Question 36
Which traversal is used by an iterative level-order algorithm with a queue?
Detailed Solution
A FIFO queue processes nodes level by level.
✓ 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 37
What is the maximum number of nodes at depth d in a binary tree?
Detailed Solution
Each level can contain at most twice as many nodes as the previous level.
✓ Saved
Question 38
For a binary tree with n nodes, what is the maximum possible number of leaf nodes?
Detailed Solution
A full binary tree maximizes the number of leaves; with $n=2I+1$ for odd n, and for even n the maximum is n/2, giving floor((n+1)/2) in both cases.
✓ Saved
Question 39
A full binary tree has I internal nodes. How many total nodes does it have?
Detailed Solution
Every internal node has two children, giving leaves I+1 and total 2I+1.
✓ Saved
Question 40
A full binary tree has N total nodes. How many leaves does it have?
Detailed Solution
For a full binary tree, $N=2I+1$ and leaves I+1=(N+1)/2.
✓ Saved