/C++/Simplest code for stack implementation in c++

Simplest code for stack implementation in c++

void pop() {
   if(top<=-1)
   cout<<"Stack Underflow"<<endl;
   else {
      cout<<"The popped element is "<< stack[top] <<endl;
      top--;
   }
}

Source: tutorialspoint.com

Simplest code for stack implementation in c++

void display() {
   if(top>=0) {
      cout<<"Stack elements are:";
      for(int i=top; i>=0; i--)
      cout<<stack[i]<<" ";
      cout<<endl;
   }else
   cout<<"Stack is empty";
}

Source: tutorialspoint.com

Simplest code for stack implementation in c++

void push(int val) {
   if(top>=n-1)
   cout<<"Stack Overflow"<<endl;
   else {
      top++;
      stack[top]=val;
   }
}

Source: tutorialspoint.com

Similar codes

0 vote212 views1 answer
C++ std map initializer list
C++
1 vote204 views1 answer
What is __asm in C++
C++
-2 votes238 views1 answer
How to make custom domain extension
C++
1 vote205 views1 answer
Print linkedstack cpp
C++
1 vote212 views1 answer
Get handle in C++
C++
0 vote197 views2 answers
Cplusplusbtutotrail
C++
1 vote214 views1 answer
Check if set contains element c++
C++
20 votes222 views5 answers
File c++
C++
0 vote188 views1 answer
Sort deque in c++
C++
0 vote279 views1 answer
Dijkstra algorithm in c++ geeksforgeeks
C++