코드공방 코드공방

#pragma once struct Node { int data; Node* next; }; class LinkedListStack { private: Node* m_top; public: LinkedListStack(); ~LinkedListStack(); void Push(int _item); int Pop(); bool IsEmpty(); }; LinkedListStack.h #include "LinkedListStack.h" LinkedListStack::LinkedListStack() : m_top(nullptr) { } LinkedListStack::~LinkedListStack() { } void LinkedListStack::Push(int _item) { Node* temp = new N..

#pragma once const int MAX = 100; class ArrayStack { private: int* m_stack; int m_top; int m_max; public: ArrayStack(int MAX); ~ArrayStack(); void Push(int _item); int Pop(); bool IsEmpty(); bool IsFull(); }; ArrayStack.h #include "ArrayStack.h" ArrayStack::ArrayStack(int MAX) : m_top(0), m_max(MAX) { m_stack = new int[MAX]; } ArrayStack::~ArrayStack() { delete[] m_stack; } void ArrayStack::Push..

#pragma once #include using namespace std; struct Node { int data; Node* prev;// Previous 이전 Node* next; }; class DoubleLinkedList { private: int m_count; Node* m_head; Node* m_tail; public: DoubleLinkedList(); ~DoubleLinkedList(); void InsertToHead(int _item); void InsertToTail(int _item); void Delete(int _position); int Retrieve(int _position); bool IsEmpty(); int GetLength(); }; DoubleLinkedL..

#pragma once #include using namespace std; struct Node { int data; Node* next; }; class LinkedList { private: int m_count; Node* m_head; public: LinkedList(); ~LinkedList(); void Insert(int _position, int _item); void Delete(int _position); int Retrieve(int _position); bool IsEmpty(); int GetLength(); }; LinkedList.h #include "LinkedList.h" LinkedList::LinkedList() : m_count(0), m_head(nullptr) ..

#pragma once #include using namespace std; const int MAX = 100; class ArrayList { private: int m_count; int m_data[MAX]; public: ArrayList(); ArrayList(const ArrayList& _arraylist); ~ArrayList(); void Insert(int _position, int _item); void Delete(int _position); int Retrieve(int _position); bool IsFull(); bool IsEmpty(); int GetLength(); }; ArrayList.h #include "ArrayList.h" ArrayList::ArrayList..