Computer Science, asked by sharanabasavame44401, 1 year ago

What are the minimum possible number of levels in a binary tree of n nodes?

Answers

Answered by souravbawa586
1

Answer: A perfect binary tree of height 3 has 23+1 – 1 = 15 nodes. Therefore it requires 300 bytes to store the tree. If the tree is full of height 3 and minimum number of nodes, the tree will have 7 nodes.

I hope it will help you

Similar questions