Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are _________.
(A) 199
(B) 200
(C) Any number between 0 and 199
(D) Any number between 100 and 200
Answer: (A)
Explanation: This can be proved using Handshaking Lemma. Refer below post to see complete proof.
Handshaking Lemma and Interesting Tree Properties
GATE | GATE-CS-2015 (Set 3) | Question 65
Recommended Articles