In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is-
- A.log(2*n)
- B.n/2
- C.n
- D.log(2*n) - 1
Show answer
Answer: C. n
In the worst case, all n nodes must be traversed.
Related questions
- Which of the following symbol table implementation is best suited if access time is to be minimum?
- A binary search tree is constructed by inserting the numbers, 60 25 72 15 30 68 13 18 in order. The number of nodes in the left sub tree is-
- A critical section is a program segment-
- A collection of objects that use common structure and a common behavior is known as-
- Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?