GATE CSE 2015 Set 3 | Question: 25

Question

Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.

Comments

Check: https://gateoverflow.in/8059/gate2015-2-10

Answer 1

199 nodes with degree 2.

Comments

ok

---

answer is 199

Answer 2

Answer is: 199

Because, In Binary Tree, number of leaf nodes is always one more than nodes with two children.

L=T+1

where, L=Number of leaf nodes

          T=Number of internal nodes with two childrens

Answer 3

Using formula for Binary Tree having N Leaf nodes there is N-1 Nodes will have two children..

So here answer will be 199.

Answer 4

we know the formula that \

no of leaf nodes= internal_nodes(degree_of_tree - 1)+1

so here given leaf nodes=200 and we know because of 2 children(mentioned in the question) degree is 2

so on putting these value we will get answer 199

200=internal_nodes(2 - 1)+1

so internal nodes=199.