Q:

Asymptotic time complexity to find an element in the linked list is

0

Asymptotic time complexity to find an element in the linked list is


  1. O(N+1)
  2. n
  3. O(n)
  4. 1

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

Correct Answer:

O(n)

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

One-dimensional Array is known as... >>
<< Another name of Circular Queue...