A stack is a very important data structure because it can store data in a very practical way. A stack is a linear data structure. Stack array list follows the Last in First Out principle. The element gets to add up at the TOP and deleted from the TOP.
Mainly the following three basic operations are performed in the stack:
Push: Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition.
Pop: Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.
Peek: Returns top element of stack.
isEmpty: Returns true if stack is empty, else false.
Mainly the following three basic operations are performed in the stack:
Push: Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition.
Pop: Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.
Peek: Returns top element of stack.
isEmpty: Returns true if stack is empty, else false.
C++ Program to Implement of stack using array
Output
9
7
10
إرسال تعليق
Thank you for vising