Binary tree
…size n has the following recursive description C 0 = 1 , and C n = ∑ i = 0 n − 1 C i C n − 1 − i for any positive integer n. It follows that C n is the Catalan number of index n. The above parenthesized strings should not be confused with the set of words of length 2n in the Dyck language, which consist only of…