Gate CS-2007 Question Paper With Solutions

Q. 7 A complete n-ary tree is a tree in which each node has n children or no children.

Let I be the number of internal nodes and L be the number of leaves in a

complete n-ary tree. If L= 41, and I =10, what is the value of n

(A) 3

(B) 4

(C) 5

(D) 6

Answer: (C)

Explanation:

Gate CS-2007 Question Paper With Solutions

Learn More:   Gate CS-2012 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here