├── 2(a)	Array Implementation of Stack ADT
└── README.md


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


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # -Array-Implementation-of-Stack-ADT
2 | ..
3 | 


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