stack c++
stack<int> stk;
stk.push(5);
int ans = stk.top(5); // ans =5
stk.pop();//removes 5
stack c++
stack<int> stk;
stk.push(5);
int ans = stk.top(5); // ans =5
stk.pop();//removes 5
push pop code in c++
#include<iostream>
using namespace std;
#define Max 100
class stack{
public:
int top;
int size;
int *s;
int stack[Max];
void push()
{
int value;
if(top==size-1)
{
cout<<"overflow";
}
else
{
cout<<"Enter value to push n";
cin>>value;
top++;
stack[top]=value;
}
}
int pop()
{
if(top==-1)
{
cout<<"Underflow";
}
else
{
cout<<"Deleted value is n"<<stack[top];
top--;
}
}
void display()
{
int i;
for(i=top;i>=0;i--)
{
cout<<stack[i]<<endl;
}
}
};
int main()
{
stack st;
cout<<"Enter the size of the stack";
cin>>st.size;
st.s=new int[st.size];
st.top=-1;
int ch;
while(st.size!=0)
{
cout<<endl<<" ##### STACK MENU ##### "<<endl;
cout<<"1. PUSH OPERATION n2. POP OPERATION n3. DISPLAY n4.Exit n";
cin>>ch;
switch(ch)
{
case 1:
st.push();
break;
case 2:
st.pop();
break;
case 3:
st.display();
break;
case 4:
exit(0);
default:cout<<"n Choose correct option";
}
}
return 0;
}
cpp stack
// Fast DIY Stack
template<class S, const int N> class Stack {
private:
S arr[N];
int top_i;
public:
Stack() : arr(), top_i(-1) {}
void push (S n) {
arr[++top_i] = n;
}
void pop() {
top_i--;
}
S top() {
return arr[top_i];
}
S bottom() {
return arr[0];
}
int size() {
return top_i+1;
}
};
stack c++
#include <bits/stdc++.h>
stack<int> stk;
stk.push(5);
int ans = stk.top(5); // ans =5
stk.pop();//removes 5
Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us