COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
the address of the next datum
|
|
|
the address of the head of the list
|
|
|
the null value to signify the end of the list
|
|
|
None of the above
|
Detailed explanation-1: -Each element in a linked list is stored in the form of a node. A node is a collection of two sub-elements or parts. A data part that stores the element and a next part that stores the link to the next node. A linked list is formed when many such nodes are linked together to form a chain.
Detailed explanation-2: -Like arrays, a Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at a contiguous location; the elements are linked using pointers. They include a series of connected nodes. Here, each node stores the data and the address of the next node.
Detailed explanation-3: -A list in which last node points back to the header node is called circular linked list.
Detailed explanation-4: -In the case of a singly linked list, the next of the last node contains the address of the first node and in case of a doubly-linked list, the next of last node contains the address of the first node and prev of the first node contains the address of the last node. The list can be traversed from any node.