xxxxxxxxxx
#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
class stack
xxxxxxxxxx
#include<iostream>
using namespace std;
#define Size 5
class Stack
{
private:
int Array[Size];
int top;
public:
Stack()
{
top = -1;
}
void Push(int x)
{
if (top == Size - 1)
{
cout << "Error, stack overFlow!" << endl;
return;
}
Array[++top] = x;
}
void Pop()
{
if (top == -1)
{
cout << "Error, stack is Empty!" << endl;
return;
}
top--;
}
int Top()
{
return Array[top];
}
bool IsEmpty()
{
if (top == -1)
return 1;
return 0;
}
void print()
{
cout << "Stack: ";
for (int i = 0; i <= top; i++)
{
cout << Array[i] << " ";
}
cout << "\n";
}
};
int main()
{
Stack s;
s.Push(1);
s.Push(2);
s.print();
return 0;
}
xxxxxxxxxx
#include <bits/stdc++.h>
stack<int> stk;
stk.push(5);
int ans = stk.top(5); // ans =5
stk.pop();//removes 5
xxxxxxxxxx
/* Stack is a data structure that provides two O(1) time operations:
adding an element to the top and removing an element from the top.
It is only possible to access the top element of a stack. */
stack<int> s;
s.push(3);
s.push(2);
s.push(5);
cout << s.top(); // 5
s.pop();
cout << s.top(); // 2
xxxxxxxxxx
#include <iostream>
#include <stack>
using namespace std;
int main() {
stack<int> stack;
stack.push(21);
stack.push(22);
stack.push(24);
stack.push(25);
stack.pop();
stack.pop();
while (!stack.empty()) {
cout << stack.top() <<" ";
stack.pop();
}
}
xxxxxxxxxx
void push(int val) {
if(top>=n-1)
cout<<"Stack Overflow"<<endl;
else {
top++;
stack[top]=val;
}
}
xxxxxxxxxx
void pop() {
if(top<=-1)
cout<<"Stack Underflow"<<endl;
else {
cout<<"The popped element is "<< stack[top] <<endl;
top--;
}
}
xxxxxxxxxx
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";
}
xxxxxxxxxx
10 pushed into stack
20 pushed into stack
30 pushed into stack
30 Popped from stack
Top element is : 20
Elements present in stack : 20 10
xxxxxxxxxx
/* C++ program to implement basic stack
operations */
#include <bits/stdc++.h>
using namespace std;
#define MAX 1000
class Stack {
int top;
public:
int a[MAX]; // Maximum size of Stack
Stack() { top = -1; }
bool push(int x);
int pop();
int peek();
bool isEmpty();
};
bool Stack::push(int x)
{
if (top >= (MAX - 1)) {
cout << "Stack Overflow";
return false;
}
else {
a[++top] = x;
cout << x << " pushed into stack\n";
return true;
}
}
int Stack::pop()
{
if (top < 0) {
cout << "Stack Underflow";
return 0;
}
else {
int x = a[top--];
return x;
}
}
int Stack::peek()
{
if (top < 0) {
cout << "Stack is Empty";
return 0;
}
else {
int x = a[top];
return x;
}
}
bool Stack::isEmpty()
{
return (top < 0);
}
// Driver program to test above functions
int main()
{
class Stack s;
s.push(10);
s.push(20);
s.push(30);
cout << s.pop() << " Popped from stack\n";
//print all elements in stack :
cout<<"Elements present in stack : ";
while(!s.isEmpty())
{
// print top element in stack
cout<<s.peek()<<" ";
// remove top element in stack
s.pop();
}
return 0;
}