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: -A linked list in which none of the nodes contains a NULL pointer is? Answer: C) Explanation: All the nodes in a circular linked list are connected in a cyclic fashion so no nodes has next address as NULL.
Detailed explanation-2: -Circular Linked List. A circular linked list is either a singly or doubly linked list in which there are no NULL values.
Detailed explanation-3: -It is a list whose last node contains the NULL pointer. In the header linked list the start pointer always points to the header node. start-> next = NULL indicates that the grounded header linked list is empty. The operations that are possible on this type of linked list are Insertion, Deletion, and Traversing.
Detailed explanation-4: -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. Both Singly Linked List and Doubly Linked List can be made into a circular linked list.