GATE CSE
First time here? Checkout the FAQ!
x
0 votes
31 views

1)Consider the AVL tree with n nodes. The best upper bound on the time required to insert n more elements in given AVL tree is O(na logb n). Then the value of a + 50b is ________.

2) http://gateoverflow.in/1776/gate2014-1_12

----------------------------------------------------------------------------------------------------------------------------------------------------

What the difference these two questions in calculation?

Ans of both question should be different?

Binary tree can be both AVL tree or BST.

best upper bound= lowest upper bound should be worst case.

Then GATE question complexity should be $\Theta (n log n)$

Plz explain

asked in DS by Veteran (51.7k points)  
edited by | 31 views

In both questions there's no relation, given question is for AVL and gate question is for binary tree not AVL.

Scondly in gate question we need to find subtree i.e just traversal and in current we have to insert n elements in AVL --> which is nothing but nlogn.

So here a and b is 1. => a+50b --> 51.

Please log in or register to answer this question.

Related questions

Top Users Feb 2017
  1. Arjun

    5288 Points

  2. Bikram

    4230 Points

  3. Habibkhan

    3952 Points

  4. Aboveallplayer

    3086 Points

  5. Debashish Deka

    2378 Points

  6. sriv_shubham

    2308 Points

  7. Smriti012

    2236 Points

  8. Arnabi

    2008 Points

  9. mcjoshi

    1690 Points

  10. sh!va

    1684 Points

Monthly Topper: Rs. 500 gift card

20,860 questions
26,010 answers
59,673 comments
22,113 users