recategorized by
7,124 views

2 Answers

Best answer
3 votes
3 votes

Lets assume,

n0 = number of nodes with 0 child, so no of null branch = $ 2 * n0 $.

n1 = number of nodes with 1 child, so no of null branch = $ n1 $.

n2 = number of nodes with 2 child, so no of null branch = $ 0 $.

Total number of null branch = 2* n0 + n1


We know that, total degree sum of all nodes = 2 * (n-1)

=> 1* n0 + 2 *n1 + 3 * n2 - 1( because except root node, every other node has 1 parent node degree)= 2 ( n0 + n1 + n2 -1)

     =>                             n0   = n2 + 1. 

     =>                             n0   = n - n0 - n1 + 1                  // n0+n1+n2 = n

                               2n0 + n1 = n + 1 = total no of null branch.

For n=27, ans should be 28.

Ans - D. 


selected by

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
2 answers
2
makhdoom ghaya asked Sep 7, 2016
3,165 views
What is the maximum number of nodes in a B-tree of order $10$ of depth $3$ (root at depth $0$) ?$111$$999$$9999$None of the above
3 votes
3 votes
1 answer
3
makhdoom ghaya asked Sep 11, 2016
2,093 views
One of the distinguished features of super-computer over other category of computer isParallel processingHighest accuracy levelMore speedMore capacity
2 votes
2 votes
2 answers
4
makhdoom ghaya asked Sep 11, 2016
1,563 views
The basic concepts of ethics in information society is/areResponsibilityAccountabilityLiabilityAll of the above