OD
(Choose 1 answer)
Suppose we are implementing a queue using a singly linked list where the end of the list i:
of the queue.
}
Specify the correct implementation of enqueue() method of the queue. (Choose the most:
A. void enqueue(Object x)
{ Node p = new Node(x);
p.next = null;
tail.next = p;tail = p;
}
B. void enqueue(Object x)
{ Node p = new Node(x);
p.next = null;
if(isEmpty())
head = tail = p;
else
{ tail.next = p;
tail = p;
}
C. void enqueue(Object x){ Node p = new Node(x);
p.next = null;if(isEmpty())
head = tail = p;
else
tail.next = p;
22
