CS engg. question
In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is:
(b) (n – 1) k+ 1
(c) n( k – 1) + 1
(d) n(k – 1)
Answer (c) according to the books.
please help me to solve this..
Re: CS engg. question
Hey i get it now.. i was not including the root node among internal nodes, thats why i had confusion.
|All times are GMT +5.5. The time now is 02:51.|