×

On binary trees and Dyck paths. (English) Zbl 0848.05006

Summary: A bijection between the set of binary trees with \(n\) vertices and the set of Dyck paths of length \(2n\) is obtained. Two constructions are given which enable to pass from a Dyck path to a binary tree and from a binary tree to a Dyck path.

MSC:

05A15 Exact enumeration problems, generating functions
68R15 Combinatorics on words
PDFBibTeX XMLCite
Full Text: Numdam EuDML