If you implement a queue using a linked list, this operation:

function h(x)
newNode=new Node(x)
tail-next=Newnode
tail=newNode

is missing something. What is it?

Question

If you implement a queue using a linked list, this operation:  
 
 function h(x)  
     newNode=new Node(x) 
     tail->next=Newnode 
     tail=newNode  
 
 is missing something. What is it?

Answer

nothing is missing

Answer

the case when dequeue is performed in 1-element queue

Answer

that is not a queue operation

Answer

the case when dequeue is performed in a full list

Answer

the case when enqueue is performed in an empty queue

Crowdly

If you implement a queue using a linked list, this operation: function h(x)...

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