[Solved] A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?

Q.	A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?
A.	it waste memory space since the pointer head already points to the first node and thus the list node does not need to point to the first node.
B.	it is not possible to add a node at the end of the list.
C.	it is difficult to traverse the list as the pointer of the last node is now not null
D.	all of above
Answer» C. it is difficult to traverse the list as the pointer of the last node is now not null

1.6k

Do you find this helpful?

View all MCQs in

Data Structure and Algorithms (DSA)

Discussion

No comments yet

Related MCQs

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list
Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked lis
Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list
A variant of linked list in which last node of the list points to the first node of the list is?
In a ________ linked list, the last node's link field points to the first node of the list.
Consider the following definition in c programming language struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr; Which of the following c code is used to create new node?
A ________ linked list is a linked list which always contains a special node, called the header node.
A ________ linked list is a linked list structure in which each node has a pointer to both its successor and predecessor.
Each node in a linear list contains an item called _______ which points to the next node in the list.
Each node in a linear list contains an item called____which points to the next node in the list.