Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

what is the maximum number of distinct binary tree is possible with 4 nodes? ans is 6 but how? acc to me it should be 14

share|cite|improve this question
What is your definition of distinct? – Aryabhata Feb 2 '12 at 19:22
means different binary tree can possible – Ashish Feb 2 '12 at 19:23

I can think of no definitions of binary tree and distinct that would produce six distinct binary trees.

There are $14$ plane binary trees, i.e., rooted binary trees in which left and right offspring are distinguished. If left and right offspring are not distinguished, there are only three rooted binary trees:

   *                      *                      *   
   |                      |                     / \  
   *                      *                    *   *  
  / \                     |                    |  
 *   *                    *                    *  

If you consider unrooted trees, the last two of these are the same: there are only two unrooted binary trees.

If you consider labelled trees, the numbers go up considerably: unrooted the chain graph with four vertices already can be labelled in $12$ ways, so there’s no way to get just six.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.