Q:

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?

belongs to collection: SYSTEM PROGRAMMING BASICS MCQ

0

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?


  1. O(n)
  2. O(1)
  3. O(log n)
  4. O(n log n)

All Answers

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

 (c).O(log n)

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

total answers (1)

SYSTEM PROGRAMMING BASICS MCQ

This question belongs to these collections

Similar questions


need a help?


find thousands of online teachers now
Dividing a project into segments and smaller units... >>
<< The root directory of a disk should be placed...