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(n^{a} log^{b} 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