Which of the following data structures uses FIFO principle?
A
Graph
B
Tree
C
Stack
D
Queue
Correct Answer: Option D — Queue
Explanation:
A Queue follows the FIFO (First In First Out) principle, where elements are added at the rear and removed from the front, unlike stacks whic...
A Queue follows the FIFO (First In First Out) principle, where elements are added at the rear and removed from the front, unlike stacks which use LIFO.