GFact | Catalan Numbers

The number of structurally different Binary Trees with n nodes is Catalan number Cn = (2n)!/(n+1)!*n!

References:
http://mathworld.wolfram.com/BinaryTree.html

Article Tags :

GFacts

Recommended Articles

1. Applications of Catalan Numbers

2. Gfact | Why accumulate function in C++ gives wrong answer for large numbers?

3. Minimum changes required to make a Catalan Sequence

4. Total number of possible Binary Search Trees using Catalan Number

5. Program for nth Catalan Number

6. GFact | Why is Floating Point Arithmetic a problem in computing?

7. GFact | Why s.lower_bound(x) is faster than lower_bound(s.begin(), s.end(), x) in C++ STL?

8. GFact | Does JavaScript guarantee object property order?

9. GFact | Why Printing Boolean in C++ Display as 0 and 1

10. GFact | Why doesn't C++ have Variable Length Arrays library?

11. GFact | Why doesn't Greedy Algorithm work for 0-1 Knapsack problem?

12. GFact | Most efficient method to groupby on an array of objects in Javascript

13. GFact | Most efficient way to Concatenate Strings in Python

14. GFact | Why setTimeout callback doesn't get called or work?

15. GFact | Why Factorial of 0 is 1?

16. GFact | 6 Digit number always divisible by 7, 11 and 13 when formed by repeating a 3-digit number twice

17. GFact | Why is Circular Reference BAD in JavaScript?

18. GFact | Which Sorting Algorithm is Best and Why?

19. GFact | Enumeration constants

20. GFact | How to construct Binary Tree and Binary Search Trees?

21. GFact | Pointer arithmetic and array indexing are equivalent in C

22. GFact | C standard C99 allows inline functions and variable-length-arrays

23. GFact | Bootstrapped Programming languages

24. GFact | Difference between Pass by value and Pass-by-reference in C

25. GFact | How to define main function in ISO C?