Question

For a binary tree T with n vertices. show that the minimum possible height is rlog=(n + 1) - n whererk 1 is the smallest integer 2 k. and the maximum possible height is (1 - 1)12. Every tree has one more node than it has edges.​

Answer 1

Answer:

answer is 44

I hope this will help you