CompleteGATE Doubts Forum
0 like 0 dislike
144 views

The worst case running time to search for an element in a balanced binary search tree with n2n elements is

(A) Θ(log n

(B) Θ(n2n

(C) Θ(n)

(D) Θ(log n

asked Jun 27, 2016 in Algorithms by CompleteGATE-AskUS (3,550 points)
recategorized Jun 27, 2016 by CompleteGATE-AskUS | 144 views

1 Answer

0 like 0 dislike
(C) Θ(n)
answered Jun 27, 2016 by ebeisaac (13,250 points)
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 09/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)

×

Like us on Facebook

Show your Support. Become a FAN!

107 questions
100 answers
2 comments
63 users