What are the minimum possible number of levels in a binary tree of n nodes?
Answers
Answered by
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
Social Sciences,
6 months ago
Science,
6 months ago
English,
6 months ago
Chemistry,
1 year ago
Math,
1 year ago