Open In App

Data Structures | Queue | Question 6

Like Article
Like
Save
Share
Report

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 a linked list in any of the given two ways.

Hence option (C) is the correct answer.


Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 05 Feb, 2013
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads