First time here? Checkout the FAQ!
+3 votes

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 (39.7k points) 255 1305 1936 | 128 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 Loyal (2.7k points) 2 4 19
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)"

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23324 Points

  2. Bikram

    17048 Points

  3. Habibkhan

    7808 Points

  4. srestha

    6222 Points

  5. Debashish Deka

    5430 Points

  6. jothee

    4958 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4286 Points

  9. sushmita

    3964 Points

  10. Rishi yadav

    3794 Points

Recent Badges

Notable Question makhdoom ghaya
Popular Question LavTheRawkstar
Avid Voter atul_21
Popular Question hem chandra joshi
100 Club nikhil_cs
Notable Question Sukannya
Notable Question Sourabh Kumar
Notable Question shikharV
Nice Comment Sachin Mittal 1
Popular Question ManojK
27,287 questions
35,134 answers
33,223 users