(Choose 1 answer)
Suppose we are implementing a queue using a singly linked list where the the head of the list is treated as the head of the queue.
Specify the correct implementation of dequeue() method of the queue. (Choose the most suitable one)
A. Object dequeue()
{ if(isEmpty()) return(null);
Node p = head;head=head.next;
if(head==tail) tail=null;
return(p.info);
}
B. Object dequeue(){ if(isEmpty()) return(null);Node p = head:head=head.next;
return(p.info);
}
C. Object dequeue(){ if(isEmpty()) return(null);Node p = head;head-head.next;if(head==null) tail=null;return(p.info);
}
D. Object dequeue(){ if(isEmpty()) return(null);head=head.next;
if(head next==null) tail=null
E37
