edited by
296 views
0 votes
0 votes

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) https://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

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
1 votes
1 votes
1 answer
3
srestha asked May 2, 2019
466 views
A $d-$ary heap is a binary heap, but instead of $2$ children, nodes have $d$ children. A $d-ary$ heap can be represented by $1-D$ array as follows. The root is kept in $A...