CompleteGATE Doubts Forum

What is the tightest upper bound time complexity of binary search insertion operation?

0 like 0 dislike
304 views

  1. 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? 

    A) O(1) 

    (B) O(log n) 

    (C) O(n)

    (D) O(n log n) 

asked Jul 17, 2016 in Algorithms by CompleteGATE-AskUS (3,550 points) | 304 views

1 Answer

1 like 0 dislike
Best answer

(C) O(n)

answered Jul 17, 2016 by ebeisaac (13,250 points)
selected Jul 17, 2016 by CompleteGATE-AskUS
Welcome to Completegate AskUs, A place where you can ask questions regarding videos located at Youtube Channel and receive answers from our experts.

Sign up for our newsletter to receive the latest news and event postings.

Best Users 02/2019
  1. CompleteGATE-AskUS

    3550 Points

  2. Asma Abbasi

    200 Points

  3. Henry

    150 Points

  4. SilverChat

    140 Points

Rewards per month
First Winner: 0 INR (Not Started)
Second Winner: 0 INR (Not Started)

Most popular tags

×

Like us on Facebook

Show your Support. Become a FAN!

106 questions
100 answers
2 comments
52 users