Linear-Stack ADT
Stack ADT – Evaluating arithmetic expressions- other applications- Queue ADT – circular queue implementation – Double ended Queues – applications of queues STACK STACK ADT: TOP pointer It will always point to the last element inserted in the stack. For empty stack, top will be pointing to -1. (TOP = -1) Operations on Stack (Stack […]