COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
singly
|
|
|
doubly
|
|
|
circular
|
|
|
none of above
|
Detailed explanation-1: -A circular linked list is a linked list in which last node always point to the first node i.e. last node contains the address of the first node. As in singly linked list, each node in circular linked list consists of two parts.
Detailed explanation-2: -In a circular Singly linked list, the last node of the list contains a pointer to the first node of the list.
Detailed explanation-3: -Circular singly linked list: In a circular Singly linked list, the last node of the list contains a pointer to the first node of the list.
Detailed explanation-4: -Circular linked list is simply a singly or doubly linked list in which the last node or tail is pointing to the head or first node.
Detailed explanation-5: -A variation of linked list is circular linked list, in which the last node in the list points to first node of the list.