Maximum height of a 11 vertex binary tree is?
Answers
Answered by
3
Answer:
YOUR ANSWER
Step-by-step explanation:
- In a binary tree, a node can have maximum two children. If there are n nodes in binary tree, maximum height of the binary tree is n-1 and minimum height is floor(log2n).
Answered by
0
We need to recall the following rules about the height of a binary tree.
- The maximum height of a fully binary tree with numbers of vertices is .
- The maximum height of a non-fully binary tree with numbers of vertices is .
Given:
Number of vertex of a binary tree
From the above rules, we get
For non-fully binary tree:
Maximum height
Maximum height
Hence, the maximum height of a non-fully binary tree is .
For a fully binary tree:
Maximum height
Maximum height
Maximum height
Hence, the maximum height of a fully binary tree is approximate .
Similar questions