Panayotopoulos, A.; Sapounakis, A. On binary trees and Dyck paths. (English) Zbl 0848.05006 Math. Inf. Sci. Hum. 131, 39-51 (1995). 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 Keywords:binary trees; Dyck paths PDFBibTeX XMLCite \textit{A. Panayotopoulos} and \textit{A. Sapounakis}, Math. Inf. Sci. Hum. 131, 39--51 (1995; Zbl 0848.05006) Full Text: Numdam EuDML