Data-Structures-and-Algorithms/Nth Catalan Number at master · shoaibrayeen/Data-Structures-and-Algorithms · GitHub

Name		Name	Last commit message	Last commit date
parent directory ..
code_1.cpp		code_1.cpp
code_2.cpp		code_2.cpp
code_3.cpp		code_3.cpp
readMe.md		readMe.md

readMe.md

Catalan numbers are a sequence of natural numbers that occurs in many interesting counting problems like following.

1) Count the number of expressions containing n pairs of parentheses which are correctly matched. For n = 3, possible expressions are ((())), ()(()), ()()(), (())(), (()()).

2) Count the number of possible Binary Search Trees with n keys (See this)

3) Count the 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.