answersLogoWhite

0


Best Answer

42

http://en.wikipedia.org/wiki/Catalan_number

User Avatar

Wiki User

15y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

14y ago

For example (notation: root(left,right)):

A(-,B(-,C))

A(-,C(B,-))

B(A,C)

C(B(A,-),-)

C(A(-,B),-)

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: How many binary trees are possible with 3 nodes?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

How many different trees are possible with 10 nodes?

1014 it is. no of different trees possible with n nodes is (2^n)-n thanx


How many ordered trees are possible with 3 nodes?

6


How many no of ordered trees are possible with 3 nodes?

With 3 nodes, there are 5 possible ordered trees. This can be calculated using the formula for the number of ordered trees: n^(n-2), where n is the number of nodes. In this case, 3^(3-2) = 3^1 = 3.


How many different binary trees and binary?

Infinite (and binary).


How many binary trees are possible with 5 node?

1..15 (not allowing empty trees).


How many different binary trees can be made from three nodes?

As far as i Know, just one.Do you know any formula to calculate how many binary search trees are possible?--answer:(2n C n) / (n+1) = ( factorial (2n) / factorial (n) * factorial (2n - n) ) / ( n + 1 )where 'n' is number of element (integer/string)like:N Number of BST1 12 23 54 145 426 132and so on


How many null branches are there in a binary tree with 20 nodes?

12


What is the difference between extended binary tree and a binary search tree?

A strictly binary tree is one where every node other than the leaves has exactly 2 child nodes. Such trees are also known as 2-trees or full binary trees. An extended binary tree is a tree that has been transformed into a full binary tree. This transformation is achieved by inserting special "external" nodes such that every "internal" node has exactly two children.


How many nodes are there in the nth of a binary tree?

If N>1, there are (2N-1) - (2N-1-1), otherwise, 1 nodes in the Nth level of a balanced binary tree.


How many non leaf nodes are there in a complete binary tree of height h?

4


How many leaf nodes does the full binary tree of height h 3 have?

For a full binary tree of height 3 there are 4 leaf nodes. E.g., 1 root, 2 children and 4 grandchildren.


What is a balanced factor in data structure?

We use the term balance when referring to balanced binary trees. These are typically implemented using red/black trees, thus ensuring every parent node has as many nodes under the left branch as it has under the right branch.