GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
83 views

Choose the correct alternatives (More than one may be correct).

The number of rooted binary trees with $n$ nodes is,

  1. Equal to the number of ways of multiplying $(n+1)$ matriees.
  2. Equal to the number of ways of arranging $n$ out of $2 n$ distinct elements.
  3. Equal to $\frac{1}{(n+1)}\binom{2n}{n}$.
  4. Equal to $n!$.
asked in DS by Veteran (30k points)   | 83 views

1 Answer

0 votes
Number of BTs with Unlabelled nodes is (2n C n )/(n+1)

Number of BTs with labelled nodes is (2n C n ) * (n!) /(n+1) .

 

So, answer is option C.

If question have asked about BTs with labelled nodes then answer is B i.e picking n out of 2n people i.e 2n C n then n can be arranged in n! ways
answered by Active (2.3k points)  
still (n+1) term would be missing in option B rt?
yes arjun sir i think he forgot to mention but still they given " Number of BTs with labelled nodes is (2n C n ) * (n!) /(n+1)"


Top Users Jun 2017
  1. Bikram

    3704 Points

  2. Arnab Bhadra

    1502 Points

  3. Hemant Parihar

    1502 Points

  4. Niraj Singh 2

    1481 Points

  5. junaid ahmad

    1432 Points

  6. Debashish Deka

    1384 Points

  7. Rupendra Choudhary

    1220 Points

  8. rahul sharma 5

    1220 Points

  9. Arjun

    1168 Points

  10. srestha

    1010 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 26 - Jul 02
  1. Arjun

    208 Points

  2. akankshadewangan24

    152 Points

  3. Debashish Deka

    138 Points

  4. Hira Thakur

    130 Points

  5. Soumya29

    106 Points


23,399 questions
30,111 answers
67,490 comments
28,426 users