# Applications of Catalan Numbers

**Background :**

Catalan numbers can also be defined using following recursive formula.

The first few Catalan numbers for n = 0, 1, 2, 3, … are

**1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, …**

Refer this for implementation of n’th Catalan Number.

**Applications :**

- Number of possible Binary Search Trees with n keys.
- Number of expressions containing n pairs of parentheses which are correctly matched. For n = 3, possible expressions are ((())), ()(()), ()()(), (())(), (()()).
- Number of ways a convex polygon of n+2 sides can split into triangles by connecting vertices.

- Number of full binary trees (A rooted binary tree is full if every vertex has either two children or no children) with n+1 leaves.
- Number of different Unlabeled Binary Trees can be there with n nodes.
- The number of paths with 2n steps on a rectangular grid from bottom left, i.e., (n-1, 0) to top right (0, n-1) that do not cross above the main diagonal.

- Number of ways to insert n pairs of parentheses in a word of n+1 letters, e.g., for n=2 there are 2 ways: ((ab)c) or (a(bc)). For n=3 there are 5 ways, ((ab)(cd)), (((ab)c)d), ((a(bc))d), (a((bc)d)), (a(b(cd))).
- Number of noncrossing partitions of the set {1, …, 2n} in which every block is of size 2. A partition is noncrossing if and only if in its planar diagram, the blocks are disjoint (i.e. don’t cross). For example, below two are crossing and non-crossing partitions of {1, 2, 3, 4, 5, 6, 7, 8, 9}. The partition {{1, 5, 7}, {2, 3, 8}, {4, 6}, {9}} is crossing and partition {{1, 5, 7}, {2, 3}, {4}, {6}, {8, 9}} is non-crossing.

- Number of Dyck words of length 2n. A Dyck word is a string consisting of n X’s and n Y’s such that no initial segment of the string has more Y’s than X’s. For example, the following are the Dyck words of length 6: XXXYYY XYXXYY XYXYXY XXYYXY XXYXYY.
- Number of ways to tile a stairstep shape of height n with n rectangles. The following figure illustrates the case n = 4:

- Number of ways to connect the points on a circle disjoint chords. This is similar to point 3 above.
- Number of ways to form a “mountain ranges” with n upstrokes and n down-strokes that all stay above the original line.The mountain range interpretation is that the mountains will never go below the horizon.
- Number of stack-sortable permutations of {1, …, n}. A permutation w is called stack-sortable if S(w) = (1, …, n), where S(w) is defined recursively as follows: write w = unv where n is the largest element in w and u and v are shorter sequences, and set S(w) = S(u)S(v)n, with S being the identity for one-element sequences.
- Number of permutations of {1, …, n} that avoid the pattern 123 (or any of the other patterns of length 3); that is, the number of permutations with no three-term increasing subsequence. For n = 3, these permutations are 132, 213, 231, 312 and 321. For n = 4, they are 1432, 2143, 2413, 2431, 3142, 3214, 3241, 3412, 3421, 4132, 4213, 4231, 4312 and 4321

**Sources:**

- https://en.wikipedia.org/wiki/Catalan_number
- http://mathworld.wolfram.com/CatalanNumber.html
- http://www-groups.dcs.st-and.ac.uk/history/Miscellaneous/CatalanNumbers/catalan.html
- http://www.mhhe.com/math/advmath/rosen/r5/instructor/applications/ch07.pdf
- https://oeis.org/A000108

This article is contributed by ** Akash Srivastava**. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: **DSA Self Paced**. Become industry ready at a student-friendly price.

## Recommended Posts:

- Program for nth Catalan Number
- Program for nth Fuss–Catalan Number
- Minimum changes required to make a Catalan Sequence
- Total number of possible Binary Search Trees using Catalan Number
- Applications of various Automata
- Applications of MATLAB
- Graph Types and Applications
- Arden's Theorem and Challenging Applications | Set 2
- Containerizing Java applications | Creating a Spring Boot App using Dockerfile
- Fill the missing numbers in the array of N natural numbers such that arr[i] not equal to i
- Numbers less than N which are product of exactly two distinct prime numbers
- Check if a given pair of Numbers are Betrothed numbers or not
- Print N lines of 4 numbers such that every pair among 4 numbers has a GCD K
- Numbers within a range that can be expressed as power of two numbers
- Count numbers which can be constructed using two numbers
- Count numbers which are divisible by all the numbers from 2 to 10
- Maximum sum of distinct numbers such that LCM of these numbers is N
- Number of ways to obtain each numbers in range [1, b+c] by adding any two numbers in range [a, b] and [b, c]
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
- Absolute Difference between the Sum of Non-Prime numbers and Prime numbers of an Array