<\/span><\/h3>\n\n\n\nPUSH ( ) operation used to add elements in stack and follows the LIFO operation. Below is the code snippet that helps you to understand how actually push operation works in stack. It is a basic operation have to be performed.<\/p>\n\n\n\n
#include <iostream>\n#define MAX_STACK 30 \/\/ defines the maximum size of the stack \nclass stack_push {\n private: \n int arr[MAX_STACK];\n int top_pointer;\n \n public:\n stack_push(){ \/\/ It is a constructor \n top_pointer =-1;\n }\n \n void push_element(int value){\n if (top_pointer>=MAX_STACK-1){\n std::cout << \"Stack overflow condition\";\n }\n else \n {\n arr[++top_pointer]=value;\n std::cout << value << \"push element\";\n }\n }\n \n void show (){\n if (top_pointer==-1){\n std::cout <<\" stack is empty\";\n }\n else{\n std::cout << \" elements in a stack\";\n for(int i =0; i<=top_pointer; i++){\n std::cout<<arr[i]<< \" \";\n }\n std::cout <<\"\\n\";\n }\n \n}\n};\n\nint main()\n{\n stack_push create;\n create.push_element(90);\n create.push_element(87); \n create.show();\n return 0;\n}\n<\/code><\/pre>\n\n\n\n
![\"\"](\"https:\/\/www.iquanta.in\/blog\/wp-content\/uploads\/2025\/01\/DSAWHATSAPPBANNER-2-27-1024x159.jpg\")
<\/a><\/figure><\/div>\n\n\n