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?

mhmadesk

Save to bookmark

|

2022-06-11

|

428

Medium

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?

O(n)
O(1)
O(log n)
O(n log n)

Operating systems, MCQ Questions, Operating systems MCQ-questions,

login and add your own answer to this question

All Answers

mhmadesk

2022-06-11

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)