edited by
17,857 views
2 votes
2 votes

The time required to search an element in a linked list of length n is

  1. $O(\log_2 n)$
  2. $O(n)$
  3. $O(1)$
  4. $O(n^2)$
edited by

1 Answer

Best answer
10 votes
10 votes

The time required to search an element in a linked list of length n is O(n).

In the worst case, the element to be searched has to be compared with all elements of linked list.

Option B is correct.

selected by
Answer:

Related questions

5 votes
5 votes
3 answers
1
go_editor asked Jun 13, 2016
14,580 views
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?Deleting a node whose location is givenSearching an unsor...
2 votes
2 votes
5 answers
2
ajit asked Sep 20, 2015
19,391 views
The minimum number of fields with each node of doubly linked list is1234
4 votes
4 votes
1 answer
3
go_editor asked Jun 13, 2016
3,225 views
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known asbinary search treeAVL treecompletely ba...
9 votes
9 votes
1 answer
4