Question

Q08. If the minimum number of nodes in a binary tree is 7 then find the height of the tree
Ops: A. 06
B. 8
C. 07
D. 05

Answer 1

Answer:

Option B. 8 is correct. If you want then please mark me as brainliest

Answer 2

D. 05

Explanation:

• The height of a node in a binary tree is the largest number of edges in a path from a leaf node to a target node.
• In other words, the height of a binary tree is equal to the largest number of edges from the root to the most distant leaf node.
• If we have N elements, the minimum height of a binary tree will be log2(N)+1.
• For a full binary tree, the maximum height will be N/2. For a non-full binary tree, the maximum height will be N.
• The maximum height of the tree will be log2(7) + 1
• Height = log(14) + 1
• Height = 5