COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
data
|
|
|
address of a next node
|
|
|
node
|
|
|
none of above
|
Detailed explanation-1: -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. Each node points to the next node present in the order.
Detailed explanation-2: -Elements in a linked list are called nodes. address (random memory location) of the next node. The next node in the list is referred to as the successor. The first node in the list is called head.
Detailed explanation-3: -A node contains two fields i.e. data stored at that particular address and the pointer which contains the address of the next node in the memory. The last node of the list contains pointer to the null.
Detailed explanation-4: -In a singly linked circular linked list, each node has a pointer that points to the next node in the list. The last node in the list points back to the first node. In a doubly linked circular linked list, each node has pointers that point to both the next node and the previous node.