Push Operation in Stack Data Structure using C++ | Data Structures and Algorithms Tutorial смотреть онлайн

In this C++ tutorial, we're going to learn how to perform a push operation in a stack data structure. By the end of this tutorial, you will be able to understand how to effectively use push operations in stack data structures to improve your efficiency when dealing with data.

If you're looking to learn more about data structures and algorithms, then this is the tutorial for you! In this video, we'll be covering various data structures and how to use them, as well as discussing various push operations. By the end of the tutorial, you will have a solid understanding of how push operations work and how to use them effectively in stack data structures!
In This Video We Learn Push Operation in Stack Data Structure using C++ and Algorithm for Push and Pop operation on Stack Step by Step with Easy Examples
With
Prof: Muhammad Safdar Dogar

Code Example:

#include(iostream)
using namespace std;
class stack{
private:
int top;
int stk[10];
public:
stack(){
top = -1;
}
void push(int a){
if(top == 9){
cout(("stack is overflow";
system("pause");
return;
}
top = top + 1;
stk[top] = a;
}
void pop(){
int val;
if(top == -1){
cout(("Stack is Empty";
system("pause");
return;
}
val = stk[top];
stk[top] = NULL;
top = top -1;
cout(("Value "((val ((" is Removed "((endl;
}

void display(){
if(top == -1){
cout(("Stack Empty"((endl;
system("pause");
return;
}
for(int i = top; i)=0; i--)
cout((stk[i]((endl;
//system("pause");
}
};
main(){
stack s;
int num,op;
char choice;
do{
system("cls");
cout(("1- Pushing Stack "((endl;
cout(("2- Popping Stack "((endl;
cout(("3- Display Stack "((endl;
cout(("4- Exit "((endl;
cin))op;
switch(op){
case 1:
cout(("Enter value to insert:";
cin))num;
s.push(num);
break;
case 2:
s.pop();
break;
case 3:
cout(("Stack Value"((endl;
s.display();
break;

}

cout(("Do You Want to Continue or Exit ?";
cin))choice;
}while(choice == 'y'|| choice == 'Y');


}

Algorithm of Push Operation

Algorithm PUSH(STK, A)
{ This algorithm is used to Push data item A into a stack ‘STK’ }
Step-1 [ check stack whether it has space or not]
IF TOP )= N THEN
PRINT “Stack is overflow”
Return
Step-2 [Insert value A into stack]
TOP = TOP + 1
STK[TOP] = X
Step-3 [FINISH]
EXIT