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?

  1. A.

    00

  2. B.

    11

  3. C.

    (n−1)/2(n- 1 ) / 2

  4. D.

    n−1n - 1

Attempted by 730 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…