In a binary tree with n nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child?
|(A) 0||(B) 1||(C) (n ? 1) /2||(D) n-1|
Explain this Question