A queue based on a linked list uses the following code
Class Node{
String element;
Node next;
Node (String el,Node n){
Element = el;
Next = n;
}
}
Node front = null,rear = null;
What is the right code for void add(String x)operation? Such an operation adds x to the queue
A) rear = new Node(x,null);
B) rear = new Node(x,null.;rear = rear.next;
C) if (rear != null.
{
Rear.next = new Node(x,null.;
Rear = rear.next;
}
Else
{
Rear = new Node(x,null.;
Front = rear;
}
D) if (rear != null.
{
Rear.next = new Node(x,null.;
Rear = rear.next;
}
Else
{
Rear.next = new Node(x,null.;
Front = rear;
}

Question

Quizplus · Accepted Answer

The correct code for adding an element to a queue based on a linked list is to create a new node with the given element and set its next pointer to null. If the rear pointer is not null, then set the next pointer of the current rear node to the new node and update the rear pointer to the new node. If the rear pointer is null, then set both the front and rear pointers to the new node. Therefore, choice C is the correct code for adding an element to the queue.

A Queue Based on a Linked List Uses the Following