a) Tree
b) Linked List
c) Stack
d) Queue
Explanation:
- LIFO means the last element added to the stack is the first one to be removed.
- Imagine a stack of plates. The last plate you put on the stack is the first one you take off.
- This behavior is essential in many applications, such as function calls, expression evaluation, and backtracking algorithms.
Key operations of a stack:
- Push: Adds an element to the top of the stack.
- Pop: Removes the top element from the stack.
- Peek: Returns the top element without removing it.
- isEmpty: Checks if the stack is empty.