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

asked in DS by Active (1.2k points)   | 45 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 (59.6k points)  
selected by

Related questions

+2 votes
1 answer
1
asked in DS by thor Boss (8.3k points)   | 83 views
+1 vote
0 answers
3
asked in Programming & DS by jenny101 Active (1.2k points)   | 33 views
Top Users Jan 2017
  1. Debashish Deka

    8322 Points

  2. sudsho

    5166 Points

  3. Habibkhan

    4718 Points

  4. Vijay Thakur

    4468 Points

  5. Bikram

    4420 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4072 Points

  8. santhoshdevulapally

    3732 Points

  9. Sushant Gokhale

    3514 Points

  10. GateSet

    3336 Points

Monthly Topper: Rs. 500 gift card

19,157 questions
24,065 answers
52,872 comments
20,288 users