COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Singly linked list
|
|
|
Doubly linked list
|
|
|
Circular linked list
|
|
|
None of the above
|
Detailed explanation-1: -Circular Linked List is a variation of Linked list in which the first element points to the last element and the last element points to the first element.
Detailed explanation-2: -A variation of linked list is circular linked list, in which the last node in the list points to first node of the list.
Detailed explanation-3: -A doubly linked list is a list that has two references, one to the next node and another to previous node. Another important type of a linked list is called a circular linked list where last node of the list points back to the first node (or the head) of the list.
Detailed explanation-4: -Circular Header Linked List. A list in which last node points back to the header node is called circular linked list.
Detailed explanation-5: -The first node is called the head; it points to the first node of the list and helps us access every other element in the list. The last node, also sometimes called the tail, points to NULL which helps us in determining when the list ends.