IsEmpty: Returns true if the stack is empty, else false.
Peek or Top: Returns the top element of the stack. If the stack is empty, then it is said to be an Underflow condition. The items are popped in the reversed order in which they are pushed. If we try to pop from an empty stack then it is known as underflow and if we try to push an element in a stack that is already full, then it is known as overflow. When we want to insert an element into the stack the operation is known as the push operation whereas when we want to remove an element from the stack the operation is known as the pop operation. In order to make manipulations in a stack, there are certain operations provided to us. Some of its main operations are: push(), pop(), top(), isEmpty(), size(), etc. The plate which we put last is on the top and since we remove the plate that is at the top, we can say that the plate that was put last comes out first. You can take a pile of plates kept on top of each other as a real-life example. This strategy states that the element that is inserted last will come out first. The order may be LIFO(Last In First Out) or FILO(First In Last Out). Stack is a linear data structure that follows a particular order in which the operations are performed.
ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys.
0 kommentar(er)
