Visualisation of Data Structures
STACKS
Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).
Reference View Visualisation
Queue
A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO).
Reference View Visualisation
Infix to Postfix
Conventional notation is called infix notation. The arithmetic operators appears between two operands. Parentheses are required to specify the order of the operations.
Reference View Visualisation
Postfix Evaluation
The Postfix notation is used to represent algebraic expressions. The expressions written in postfix form are evaluated faster compared to infix notation as parenthesis are not required in postfix.
Reference View Visualisation