CSD201_-_SU_2024_-_RE_2502.webp

(Choose 1 answer)
tail.next = p;
tail = p;}
B. void enqueue(Object x)
p.next = null;if(isEmpty())
{ Node p = new Node(x);}
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;}
D. void enqueue(Object x){ Node p = new Node(x);
p.next = null;
if(isEmpty())head = tail = p;
else
tail = p;
}