Gate CS-2010 Question Paper With Solutions

Q. 33 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

Answer: (A)

Explanation:

Gate CS-2010 Question Paper With Solutions

Learn More:   Gate CS-2005 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here