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

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

Question

If you implement a queue using a linked list, this operation:  
 
 function h(x)  
      newNode=new Node(x) 
      tail->next=Newnode 
      front->next=newNode

Answer

corresponds to the is empty operation

Answer

this is not a queue operation

Answer

corresponds to the peek operation

Answer

corresponds to the dequeue operation

Answer

corresponds to the enqueue operation

Crowdly

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

Хочете миттєвий доступ до всіх перевірених відповідей на learn.gold.ac.uk?