1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.

CS engg. question

Discussion in 'Engineering Concepts' started by aryan123, Jan 3, 2012.

  1. aryan123

    aryan123 New Member

    Joined:
    Jan 9, 2011
    Messages:
    22
    Likes Received:
    0
    Trophy Points:
    0
    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:
    (a) nk
    (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..
     
  2. aryan123

    aryan123 New Member

    Joined:
    Jan 9, 2011
    Messages:
    22
    Likes Received:
    0
    Trophy Points:
    0
    Hey i get it now.. i was not including the root node among internal nodes, thats why i had confusion.
     

Share This Page