Create stack push & pop opeartion

C/stack push & pop opeartion

@@ -0,0 +1,77 @@
+#include<iostream>
+#include<cstdlib>
+using namespace std;
+#define SIZE 10
+template <class X>
+class stack
+{
+X *arr;
+int top;
+int capacity;
+public:
+stack(int size = SIZE); void push(X);
+X pop();
+X peek();
+int size();
+bool isEmpty(); bool isFull();
+~stack(){
+delete[] arr; }
+
+};
+template <class X> stack<X>::stack(int size)
+{
+arr = new X[size];
+capacity = size;
+top = -1; }
+template <class X>
+void stack<X>::push(X x)
+{
+if (isFull()) {
+cout << "OverFlow\nProgram Terminated\n";
+exit(EXIT_FAILURE); }
+cout << "Inserting " << x << endl;
+arr[++top] = x; }
+template <class X>
+X stack<X>::pop()
+{
+if (isEmpty())
+{
+cout << "UnderFlow\nProgram Terminated\n";
+exit(EXIT_FAILURE); }
+cout << "Removing " << peek() << endl;
+return arr[top--];
+}
+template <class X>
+X stack<X>::peek()
+{
+if (!isEmpty())
+return arr[top];
+else
+exit(EXIT_FAILURE);
+}
+template <class X>
+int stack<X>::size()
+{
+return top + 1; }
+template <class X>
+bool stack<X>::isEmpty() {
+return top == -1; // or return size() == 0; 
+}
+template <class X>
+bool stack<X>::isFull()
+{
+return top == capacity - 1;
+}
+int main() {
+stack<string> pt(2); pt.push("A"); pt.push("B"); pt.pop();
+// or return size() == capacity;
+pt.pop();
+pt.push("C");
+cout << "Top element is: " << pt.peek() << endl;
+
+if (pt.isEmpty())
+cout << "Stack Is Empty\n";
+else
+cout << "Stack Is Not Empty\n";
+return 0; }
+