For a non-empty linked list, select the code that should appear in a function that adds a node to the end of the list. newPtr is a pointer to the new node to be added and lastPtr is a pointer to the current last node. Each node contains a pointer nextPtr.
A) lastPtr-nextPtr = newPtr; lastPtr = newPtr
B) lastPtr = newPtr; lastPtr-nextPtr = newPtr
C) newPtr-nextPtr = lastPtr; lastPtr = newPtr
D) lastPtr = newPtr; newPtr-nextPtr = lastPtr

Question

For a non-empty linked list, select the code that should appear in a function that adds a node to the end of the list. newPtr is a pointer to the new node to be added and lastPtr is a pointer to the current last node. Each node contains a pointer nextPtr.
A) lastPtr->nextPtr = newPtr; lastPtr = newPtr
B) lastPtr = newPtr; lastPtr->nextPtr = newPtr
C) newPtr->nextPtr = lastPtr; lastPtr = newPtr
D) lastPtr = newPtr; newPtr->nextPtr = lastPtr

Quizplus · Accepted Answer

Option A correctly adds the new node to the end of the list by setting the next pointer of the current last node to the new node, and then updating the last pointer to point to the new node.

For a Non-Empty Linked List, Select the Code That Should