In a binary tree with n nodes, every node has an odd number of descendants.…

GATE · 2010 · CS · Computer Science & IT

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\)

Attempted by 703 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2