Question 86
A perfect binary tree has height 8 (root at height 0). How many total nodes does it contain?
Detailed Solution
$2^{8+1}-1 = 511.$
✓ 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 87
A full binary tree has 23 internal nodes. How many leaf nodes does it have?
Detailed Solution
A full binary tree has leaves = internal nodes + 1.
✓ Saved
Question 88
How many edges are there in a tree with 75 vertices?
Detailed Solution
Every tree with n vertices has n-1 edges.
✓ Saved
Question 89
A complete binary tree has 255 nodes. What is its height when the root has height 0?
Detailed Solution
255=$2^8-1$, so height is 7.
✓ Saved
Question 90
How many NULL child pointers are there in a binary tree with 40 nodes?
Detailed Solution
A binary tree with n nodes has n+1 NULL child pointers.
✓ Saved