1
Question
Which of the following are true with respect to linked list?
I. Each link of node contains a pointer to the next node.
II. Searching an element in singly linked list is sequential.
III. Linked list are best suited for radix sort and binary search where searching on element is dynamic
IV. Each node contains a data part and pointer to the next node where an array of pointer ponts to the links.
Which of the following are true with respect to linked list?
I. Each link of node contains a pointer to the next node.
II. Searching an element in singly linked list is sequential.
III. Linked list are best suited for radix sort and binary search where searching on element is dynamic
IV. Each node contains a data part and pointer to the next node where an array of pointer ponts to the links.
Open in App
Solution
The correct option is C I & II
Binary search will not work linked list since we can not access middle element in linked list directly. A linked list consists nodes which contain two parts. The first part store data and the second part has a pointer that points to the next node.
Binary search will not work linked list since we can not access middle element in linked list directly. A linked list consists nodes which contain two parts. The first part store data and the second part has a pointer that points to the next node.
Suggest Corrections
0
Similar questions
View More
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
