COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Doubly Linked List
|
|
|
Circular Linked List
|
|
|
Both a & b
|
|
|
None of the above
|
Detailed explanation-1: -A doubly linked list is one in which all nodes are linked together by multiple number of links which help in accessing both the successor node and predecessor node from the given node position.
Detailed explanation-2: -⌚Doubly Linked List. A doubly linked list is a more advanced type of linked list that has a pointer to both the previous and next node in the sequence.
Detailed explanation-3: -Linked lists containing both successor and predecessor references are known as doubly-linked. The head of a linked list is the node containing the first element of the sequence.
Detailed explanation-4: -There are two types of circular linked lists: singly linked and doubly linked. In a singly linked circular linked list, each node has a pointer that points to the next node in the list.
Detailed explanation-5: -Doubly linked list is a complex type of linked list in which a node contains a pointer to the previous as well as the next node in the sequence.