Data Structures | Queue | Question 6

Which of the following is true about linked list implementation of queue?
(A) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.
(B) In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.
(C) Both of the above
(D) None of the above


Answer: (C)

Explanation: To keep the First In First Out order, a queue can be implemented using linked list in any of the given two ways.

My Personal Notes arrow_drop_up

Save