Sur les arbres binaires et les chemins de Dyck. Une bijection entre les arbres binaires à n sommets et les chemins de Dyck de longeur 2n est obtenue. Deux constructions permettent de passer d'un chemin de Dyck à un arbre binaire et d' un arbre binaire à un chemin de Dyck.
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.
@article{MSH_1995__131__39_0, author = {Panayotopoulos, A. and Sapounakis, A.}, title = {On binary trees and {Dyck} paths}, journal = {Math\'ematiques informatique et sciences humaines}, pages = {39--51}, publisher = {Ecole des hautes-\'etudes en sciences sociales}, volume = {131}, year = {1995}, mrnumber = {1373114}, zbl = {0848.05006}, language = {en}, url = {http://www.numdam.org/item/MSH_1995__131__39_0/} }
TY - JOUR AU - Panayotopoulos, A. AU - Sapounakis, A. TI - On binary trees and Dyck paths JO - Mathématiques informatique et sciences humaines PY - 1995 SP - 39 EP - 51 VL - 131 PB - Ecole des hautes-études en sciences sociales UR - http://www.numdam.org/item/MSH_1995__131__39_0/ LA - en ID - MSH_1995__131__39_0 ER -
Panayotopoulos, A.; Sapounakis, A. On binary trees and Dyck paths. Mathématiques informatique et sciences humaines, Tome 131 (1995), pp. 39-51. http://www.numdam.org/item/MSH_1995__131__39_0/
[1] Catalan numbers, their generalization and their uses", The Mathematical Intelligencer, 2 (1991), 64-75. | MR | Zbl
, , "[2] q-Bessel, arbres, et chemins valués ", J. Combin. Theory, Ser. A 60 (1992), 225-245. | MR | Zbl
, "[3] On binary trees and permutations", Math. Inf. Sci. hum., 117 (1992), 61-70. | Numdam | MR | Zbl
, , "[4] Scaffold permutations", Discrete Math., 75 (1989), 335-342. | MR | Zbl
, "