Catalan number
Give an algorithm to map a set of n parentheses that are correctly matched up to a triangulation of an (n + 2)-gon. This algorithm should give a bijection between these two objects.
5 years ago 50
Answer(0)
other Questions(10)
Give an algorithm to map a set of n parentheses that are correctly matched up to a triangulation of an (n + 2)-gon. This algorithm should give a bijection between these two objects.