Chaque arbre binaire est associé à une permutation avec des répétitions qui le détermine uniquement. Deux opérations sont introduites construire l'ensemble de tous les arbres binaires. L'ensemble de toutes les permutations qui correspondent à un arbre binaire donné est déterminé et son nombre cardinal est évalué.
Every binary tree is associated to a permutation with repetitions, which determines it uniquely. Two operations are introduced and used for the construction of the set of all binary trees. The set of all permutations which correspond to a given binary tree is determined and its cardinal number is evaluated.
@article{MSH_1992__117__61_0, author = {Panayotopoulos, A. and Sapounakis, A.}, title = {On binary trees and permutations}, journal = {Math\'ematiques et Sciences humaines}, volume = {120}, year = {1992}, pages = {61-70}, mrnumber = {1164609}, zbl = {0846.05021}, language = {en}, url = {http://dml.mathdoc.fr/item/MSH_1992__117__61_0} }
Panayotopoulos, A.; Sapounakis, A. On binary trees and permutations. Mathématiques et Sciences humaines, Tome 120 (1992) pp. 61-70. http://gdmltest.u-ga.fr/item/MSH_1992__117__61_0/
[1] A numbering system for binary trees", Comm. ACM 20, 2, 1977, pp.113-115. | Zbl 0345.68025
, "[2] The art of computer programming, Vol. 1: Fundamental algorithms, Reading Mass. Addison-Wesley, 1973. | MR 378456
,[3] Scaffold permutations", Discrete Math. 75, 1989, pp.335-342. | MR 1001406 | Zbl 0668.05001
, "[4] Generation of binary trees from ballot sequences", J. AMC 25, 1978, pp.396-404. | MR 495167 | Zbl 0379.68029
, and , "