└── ArrayImplementation_of_StackADT.c++


/ArrayImplementation_of_StackADT.c++:
--------------------------------------------------------------------------------
 1 | #include<iostream.h>
 2 |  #include<conio.h> 
 3 |  #include<stdlib.h>
 4 | //using namespace std; class stack
 5 | {
 6 | int stk[5]; int top; public:
 7 | stack()
 8 | {
 9 | top=-1;
10 | }
11 | void push(int x)
12 | {
13 | if(top > 4)
14 | {
15 | cout <<"stack over flow"; return;
16 | }
17 | stk[++top]=x;
18 | cout <<"inserted" <<x;
19 | }
20 |  
21 | 
22 | void pop()
23 | {
24 | if(top <0)
25 | {
26 | cout <<"stack under flow"; return;
27 | }
28 | cout <<"deleted" <<stk[top--];
29 | }
30 | void display()
31 | {
32 | if(top<0)
33 | {
34 | cout <<" stack empty"; return;
35 | }
36 | for(int i=top;i>=0;i--) cout <<stk[i] <<" ";
37 | }
38 | };
39 | 
40 | main()
41 | {
42 | Clrscr(); int ch; stack st; while(1)
43 | {
44 | cout <<"\n1.push 2.pop 3.display 4.exit\nEnter ur choice"; cin >> ch; switch(ch)
45 | {
46 | case 1: cout <<"enter the element"; cin >> ch;
47 | st.push(ch); break;
48 | case 2: st.pop(); break; case 3: st.display();break; case 4: exit(0);
49 | }
50 | }
51 | return (0);
52 | }
53 | 


--------------------------------------------------------------------------------