GATE CSE
First time here? Checkout the FAQ!
x
+4 votes
51 views

asked in DS by Active (1.3k points)   | 51 views

1 Answer

+3 votes
Best answer

Let us do it like this :

No of nodes at depth 0   =  1 [ Root node ]

From this we have k children so 

No of nodes at depth 1   = k

From each of this we will have k children in next level..

No of nodes at depth 2  =  k2

Hence at depth k , no of nodes which will be leaf nodes as it is the

maximum level according to the question   =  kd

Hence C) is the correct answer

answered by Veteran (65.2k points)  
selected by

Related questions

+2 votes
1 answer
1
asked in DS by thor Boss (8.6k points)   | 88 views
+1 vote
0 answers
3
asked in Programming & DS by jenny101 Active (1.3k points)   | 44 views


Top Users Mar 2017
  1. rude

    5236 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2732 Points

  5. Debashish Deka

    2602 Points

  6. 2018

    1574 Points

  7. Vignesh Sekar

    1430 Points

  8. Bikram

    1424 Points

  9. Akriti sood

    1420 Points

  10. Sanjay Sharma

    1128 Points

Monthly Topper: Rs. 500 gift card

21,549 questions
26,889 answers
61,249 comments
23,251 users