208 views
0 votes
0 votes

Any AVL tree of height h+1 contains strictly more nodes than any AVL tree of height h. ?

Its a false statement right ? what is the correct statement then ,because if in any tree Height is inversely proportional to number of nodes. Minimum height means maximum number of nodes in the level and maximum height means minimum number of nodes per level.

So is the correct statement is :- Any AVL tree of height h+1 contains strictly lesser nodes than any AVL tree of height h. ?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Hirak asked Jun 2, 2019
1,227 views
#include<iostream using namespace std; int i=0; void a() { i+=1; cout<<i<< ".hello"<<endl; a(); } int main() { a(); }For this above code the output is only upto → 6489...
0 votes
0 votes
1 answer
2
Raj Kumar 7 asked Jul 22, 2018
664 views
Given a pointer to a node to be deleted what is the time complexity to delete a node in the circular linked list :i think answer is O(1).Am i right?
0 votes
0 votes
0 answers
3
Raj Kumar 7 asked Jul 17, 2018
635 views
The number of different directed trees with 3 nodes areA) 3B) 4C) 5D) 6I think the answer is 5 but the answer is not.
0 votes
0 votes
2 answers
4
vijju532 asked Jul 5, 2018
731 views
i am getting 4,3,4,3,8,2 is it right?????