One of the following options is a form of access used to add and remove nodes from a queue ?
A. LIFO
B. FIFO
C. Both LIFO and FIFO
D. Recursion
Answer : B. FIFO
Explanation
- Queues are first in first out.
- In a FIFO data structure, the first element added to the queue will be the first one to be removed.
