Question 96
A perfect binary tree has 63 nodes. How many leaves does it have?
Detailed Solution
A perfect tree with 63 nodes has 32 leaves.
✓ Saved
GATE CSE Trees – Data Structures Practice Test | Set 1
Your score
0/100
0 answered
Correct 0
Incorrect 0
Unanswered 100
Accuracy 0%
Question 97
A binary tree has 30 nodes. What is the maximum possible height measured in edges?
Detailed Solution
A completely skewed binary tree has n-1 edges on its longest root-to-leaf path.
✓ Saved
Question 98
A full binary tree has 31 leaves. How many internal nodes does it have?
Detailed Solution
For a full binary tree, $I=L-1$.
✓ Saved
Question 99
How many nodes are at depth 6 in a perfect binary tree?
Detailed Solution
At depth d, a perfect binary tree has $2^d$ nodes.
✓ Saved
Question 100
A BST is built by inserting keys 4, 2, 6, 1, 3, 5, 7. What is its height in edges?
Detailed Solution
The tree is perfect with levels 0,1,2, so its height is 2.
✓ Saved