Data-Structures-And-Algorithms/stack_using_array.cpp at master · KISHOREMUTHU/Data-Structures-And-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
//# Data-Structures-And-Algorithms
//Here I will post my regular DSA problems

// Stack implementation  using array

#include<iostream>
#include<conio.h>
#include<string.h>
#define n 5
using namespace std;

class stack{

     int s[n];
     int top;
     int x;

  public:

  stack()
     {
   top=-1; //Assigning initial top value to be -1
     }

 void push() //Pushing value into the stack
          {
       int x;

   if(top==n-1){
         cout<<"Stack Overflow"<<endl;
                }

     else{
        cout<<"Enter element: ";
         cin>>x;
         s[++top]=x;
         }

        }

 void pop() //Popping out the element out of stack
      {

     if(top==-1){
      cout<<"Stack is Empty"<<endl;
              }

     else{
       cout<<"Popped Element: "<<s[top]<<endl;
       top--;
         }

    }
  void display () //displaying the elements inside the stack
         {

      if(top==-1){
        cout<<"Stack is Empty"<<endl;
              }

       else{
      cout<<"Elements in stack are: ";
       for(int i=0;i<=top;i++)
              {
        cout<<s[i]<<" ";
              }

            cout<<endl;
        }

        }

    void peek() //Displaying the topmost element without removing it
            {

       if(top==-1){
        cout<<"Stack is Empty"<<endl;
                 }

        else{
          cout<<"Top element is: "<<s[top]<<endl;
           }

         }

   void is_empty() //Check whether stack is empty or not
         {

        if(top==-1){
        cout<<"True"<<endl;
                 }

       else{
           cout<<"False"<<endl;
           }

        }

  void is_full() //Check whether stack is full or not

          {

        if(top==(n-1)){
         cout<<"True"<<endl;
                }

          else{
          cout<<"False"<<endl;
           }

        }

};

int main(){

    class stack stk;
     int ele;
    int opt;
    char a;

    do{

       cout<<"Enter option: ";
        cin>>opt;

        switch(opt)
             {

          case 1:
               stk.push();
               break;
          case 2:
               stk.pop();
              break;
          case 3:
               stk.display();
                break;
          case 4:
                stk.peek();
                 break;
          case 5:
               stk.is_full();
                break;
          case 6:
               stk.is_empty();
                break;
           default:
                cout<<"Invalid choice"<<endl;
                break;

             }

       cout<<"Continue ? : ";
       cin>>a;//y or n

       } while (a=='y');

       return 0;

       }