Question 158Asked in CIL MT Systems, 27 Feb 2020 (8:00 AM)

Consider the binary search tree with n elements. The time required to search given element is: _______

  1. AO(log n)
  2. BO(n log n)
  3. CO(n² log n)
  4. DO(n²)
Show answerHide answer

Correct answer: (A) O(log n)

From CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM)

This is question 158 of CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.