-
In a binary tree with n nodes, every node has an odd number of descendant. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child ?
-
- 0
- 1
- (n – 1)/2
- n – 1
- 0
Correct Option: A
Such a binary tree is full binary tree (a binary tree where every node has 0 or 2 children).
