GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
54 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 (29k points)   | 54 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.2k 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 Feb 2017
  1. Arjun

    5386 Points

  2. Bikram

    4230 Points

  3. Habibkhan

    3952 Points

  4. Aboveallplayer

    3086 Points

  5. Debashish Deka

    2564 Points

  6. sriv_shubham

    2318 Points

  7. Smriti012

    2236 Points

  8. Arnabi

    2008 Points

  9. mcjoshi

    1696 Points

  10. sh!va

    1684 Points

Monthly Topper: Rs. 500 gift card

20,863 questions
26,021 answers
59,689 comments
22,131 users