Stacks

A Stack is an abstract data type or collection where in Push,the addition of data elements to the collection, and Pop, the removal of data elements from the collection, are the major operations performed on the collection. The Push and Pop operations are performed only at one end of the Stack which is referred to as the 'top of the stack'.

In other words,a Stack can be simply defined as Last In First Out (LIFO) data structure,i.e.,the last element added at the top of the stack(In) should be the first element to be removed(Out) from the stack.

List of Stack Data Structure Examples

1. Stack introduction & implementation
2. Java Dynamic Stack Implementation
3. Stack implementation using generics bounded type.
4. Reverse a word or string using Stack data structure.
5. Write a program to find out delimiter matching using stack.
6. Convert a decimal into a binary number using stack.
7. Towers of Hanoi implementation using stack.
8. Evaluation of an infix expression that is fully parenthesized using stack in java.