DS BINARY TREE

Question

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

Comments

$99$?

---

if the binary tree is full.

Answer 1

The number of INTERNAL nodes in the binary tree that have exactly two children is calculated as : number of leaf node -1.

you can verify it by some eg.

so for 100 node number of INTERNAL nodes that have exactly two children are 99.

Comments

Is it applicable to any type of binary tree?

---

yes, it's true for all BT.