How to generate all correct strings of parenthesis using the backtracking method. A string is correct if, at each moment the number of open parenthesis are greater or equal to the closed ones and, at the end, the number of open is equal to the closed ones. A recursive implementation is given. The number of such string is called Catalan number.
