DSA · Theory

Application of Stack

Theory

19/810

Application of Stack is a DSA topic. In plain words you use it for undo typing in a tiny editor. Don’t start with a slogan — start with that picture.

Smallest example: push / pop LIFO. Type it, run it, and say what you see. If you can do that from memory, you know Application of Stack.

From the example next to this theory — Application of Stack — stack is LIFO: push/pop from the same end.

Trap — pop on empty. Fix that before you talk about advanced DSA.

Viva — what is Application of Stack? Then show push / pop LIFO. Then name the trap.

Diagram

    | 3 |  ← top (pop)
    | 2 |
    | 1 |
    LIFO

Exam tip

What is Application of Stack? Show this: push / pop LIFO. Trap: pop on empty.

stack = []
stack.append(10)   # push
stack.append(20)
print(stack.pop()) # 20
print(stack[-1])   # peek → 10

Application of Stack — stack is LIFO: push/pop from the same end.