스택 기본구성 #include #include using namespace std; template class stack { int top; T* array; public: stack() { top = -1;} ~stack() { delete[]array; } void create(int size) { array = new T[size]; } void push(T element) { array[++top]=element; } T pop() { T res; res = array[top]; top--; return res; } T peak() { return array[top]; } int _size() { return top + !; } bool is_empty() { if (top == -1)return..