in Algorithms
276 views
2 votes
2 votes
A tree with n nodes and the property that the heights of the two children of any node differ by at most 2 has O(log n) height.

Please explain this statement to be true or false.
in Algorithms
by
276 views

2 Comments

i think it is correct
1
1
True statement
1
1

Please log in or register to answer this question.