COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The last node of the singly-linked list contains ____
|
|
INFO
|
|
|
NULL
|
|
|
NEXT
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -The last node has a reference to null. The entry point into a linked list is called the head of the list. It should be noted that head is not a separate node, but the reference to the first node. If the list is empty then the head is a null reference.
Detailed explanation-2: -The last node of the list contains pointer to the null.
Detailed explanation-3: -The last node of a linked list has the reference pointer as NULL.
Detailed explanation-4: -In a Circular linked list, every node points to a certain node, so there is no null pointer in a circular linked list.
There is 1 question to complete.