...
GATE 2005
March 12, 2025
GATE 2005
March 12, 2025
GATE 2005
March 12, 2025
GATE 2005
March 12, 2025

GATE 2005

Question 36

In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is:

A
nk
B
(n – 1) k + 1
C
n (k – 1) + 1
D
n (k – 1)
Question 36 Explanation: 
Total nodes = nk+1 (1 for root)
Leaves = total nodes – internal nodes
= nk+1-n
= n(k-1)+1
Correct Answer: C
Question 36 Explanation: 
Total nodes = nk+1 (1 for root)
Leaves = total nodes – internal nodes
= nk+1-n
= n(k-1)+1

Leave a Reply

Your email address will not be published. Required fields are marked *