In the following code for the add method for a linked queue implementation, what is the missing code? def add(self, newItem) :
NewNode = Node(newItem, None)
If self.isEmpty() :
Self.front = newNode
Else:
Self.rear.next = newNode
< missing code >
Self.size += 1

Question

In the following code for the add method for a linked queue implementation, what is the missing code? def add(self, newItem):
NewNode = Node(newItem, None)
If self.isEmpty():
Self.front = newNode
Else:
Self.rear.next = newNode
< missing code >
Self.size += 1
A) self.rear = newNode
B) self.rear -= 1
C) self.rear.prev = None
D) self.front = self.next

Quizplus · Accepted Answer

To add a new node to the rear of the queue, we must set the "next" attribute of the current last node in the queue to the new node, and then set the "rear" attribute of the queue to the new node. Therefore, the missing code should be "self.rear = newNode", as this updates the "rear" attribute of the linked queue to the new node.

In the Following Code for the Add Method for a Linked