2,870 views

1 Answer

4 votes
4 votes

Ans should be C) 232  (assume root at height 1)

edited by

Related questions

3 votes
3 votes
1 answer
1
hrcule asked Jul 16, 2018
2,741 views
Let T be a binary search tree with n nodes and Sn be the average number of comparisons required for successful search and Un be the average number of comparison required ...
4 votes
4 votes
0 answers
2
AnilGoudar asked Jan 10, 2018
3,293 views
When node 50 will be deleted, what will be resultant AVL tree?
4 votes
4 votes
1 answer
3
Manu Thakur asked Jul 27, 2017
6,893 views
What is the max possible height of an AVL tree with 20 nodes?a. 4b.5c.6d.7 In my opinion answer should be b.5 because height of a tree with 1 node is 0 not 1, and recurre...
1 votes
1 votes
3 answers
4
slowpoke asked May 8, 2017
758 views
Which sequence If inserted in AVL tree will cause No adjustment in tree? a) 1 2 3 4 5 ...