Skip to content
Related Articles

Related Articles

Improve Article

GATE | Gate IT 2008 | Question 73

  • Last Updated : 28 Jun, 2021

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.

n3 can be expressed as
(A) n1 + n2 – 1
(B) n1 – 2
(C) [((n1 + n2)/2)]
(D) n2 – 1

Answer: (B)

Explanation: 2008_76_sol

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :