In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (GATE CS 2002)
(A) log 2 n
(B) n/2
(C) log 2 n – 1
(D) n
Answer: (D)
Explanation: In the worst case, the element to be searched has to be compared with all elements of linked list.
Quiz of this Question
Recommended Posts:
- Introduction to Data Structures | 10 most commonly used Data Structures
- Data Structures | Linked List | Question 1
- Data Structures | Linked List | Question 2
- Data Structures | Linked List | Question 3
- Data Structures | Linked List | Question 4
- Data Structures | Linked List | Question 5
- Data Structures | Linked List | Question 6
- Data Structures | Linked List | Question 7
- Data Structures | Linked List | Question 8
- Data Structures | Linked List | Question 10
- Data Structures | Linked List | Question 11
- Data Structures | Linked List | Question 12
- Data Structures | Linked List | Question 13
- Data Structures | Linked List | Question 14
- Data Structures | Linked List | Question 15
- Data Structures | Linked List | Question 16
- Data Structures | Linked List | Question 17
- Difference between Singly linked list and Doubly linked list
- Data Structures | Stack | Question 1
- Data Structures | Queue | Question 1
