Question: Which is incorrect about linked list implementation of queue? In push operation, if new nodes are inserted at the beginning of linked list, then in
Which is incorrect about linked list implementation of queue?
In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.
In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.
In pop operation, the node in the end is the first to be removed.
To keep the First In First Out order, a queue can be implemented using linked list in any of the given two ways.
In pop operation, the node in the front is the first to be removed.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
