COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
FULL
|
|
|
NULL
|
|
|
START
|
|
|
none of above
|
Detailed explanation-1: -A linked list is held using a local pointer variable which points to the first item of the list. If that pointer is also NULL, then the list is considered to be empty.
Detailed explanation-2: -Answer: When in a linked list, the start node is set to null, it is known as an “empty list” or “null list". It means that the linked list does not contain any elements, and therefore it is not holding any data.
Detailed explanation-3: -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-4: -Linked Lists are of 2 types usually: Singly Linked Lists: They are the standard linked list, where the value of the current node and the reference of the next node is only stored. The reference stored in the last node of the list is NULL.