If you implement a queue using a linked list, what does the following pseudocode do?

if (front==NULL and tail==NULL)
front=newNode
tail=newNode

Question

If you implement a queue using a linked list, what does the following pseudocode do?  
 
 if (front==NULL and tail==NULL) 
      front=newNode 
      tail=newNode

Answer

if the queue is empty, front and tail point to the new node (in the enqueue operation)

Answer

none of the others

Answer

if the queue is full, front and tail point to the new node (in the dequeue operation)

Answer

if the queue is empty, newNode points to front and tail (in the dequeue operation)

Answer

if the queue is full, a new node is created (in the enqueue operation)

Crowdly

If you implement a queue using a linked list, what does the following pseudocode...

Want instant access to all verified answers on learn.gold.ac.uk?