GATE | Gate IT 2008 | Question 74

A binary tree with n > 1 nodes has n1, n2 and n3 nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbors.

Starting with the above tree, while there remains a node v of degree two in the tree, add an edge between the two neighbors of v and then remove v from the tree. How many edges will remain at the end of the process?
(A) 2 * n1 – 3
(B) n2 + 2 * n1 – 2
(C) n3 – n2
(D) n2 + n1 – 2


Answer: (A)

Explanation: With reference to figure of answer of previous question:
2008_77_sol

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.