In computer science, a stack is a last in, first out(LIFO) abstractdata type and data structure. A stack
can have any abstractdata type as an element, but is
characterized by only two fundamental operations, the push and the
pop. The push operation adds to the top of the list, hiding any items
already on the stack, or initializing the stack if it is empty. The pop
operation removes an item from the top of the list, and returns this value to
the caller. A pop either reveals previously concealed items, or results in an
empty list.
A stack is a restricted data structure, because only a small number of
operations are performed on it. The nature of the pop and push operations also
means that stack elements have a natural order. Elements are removed from the
stack in the reverse order to the order of their addition: Therefore, the lower
elements are typically those that have been in the list the longest...... Hope you get your ans
can have any abstractdata type as an element, but is
characterized by only two fundamental operations, the push and the
pop. The push operation adds to the top of the list, hiding any items
already on the stack, or initializing the stack if it is empty. The pop
operation removes an item from the top of the list, and returns this value to
the caller. A pop either reveals previously concealed items, or results in an
empty list.
A stack is a restricted data structure, because only a small number of
operations are performed on it. The nature of the pop and push operations also
means that stack elements have a natural order. Elements are removed from the
stack in the reverse order to the order of their addition: Therefore, the lower
elements are typically those that have been in the list the longest...... Hope you get your ans
