On binary trees and permutations

A. Panayotopoulos; A. Sapounakis

Mathématiques et Sciences Humaines (1992)

  • Volume: 117, page 61-70
  • ISSN: 0987-6936

Abstract

top
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.

How to cite

top

Panayotopoulos, A., and Sapounakis, A.. "On binary trees and permutations." Mathématiques et Sciences Humaines 117 (1992): 61-70. <http://eudml.org/doc/94425>.

@article{Panayotopoulos1992,
abstract = {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.},
author = {Panayotopoulos, A., Sapounakis, A.},
journal = {Mathématiques et Sciences Humaines},
keywords = {binary tree; permutation with repetitions; number},
language = {eng},
pages = {61-70},
publisher = {Ecole des hautes-études en sciences sociales},
title = {On binary trees and permutations},
url = {http://eudml.org/doc/94425},
volume = {117},
year = {1992},
}

TY - JOUR
AU - Panayotopoulos, A.
AU - Sapounakis, A.
TI - On binary trees and permutations
JO - Mathématiques et Sciences Humaines
PY - 1992
PB - Ecole des hautes-études en sciences sociales
VL - 117
SP - 61
EP - 70
AB - 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.
LA - eng
KW - binary tree; permutation with repetitions; number
UR - http://eudml.org/doc/94425
ER -

References

top
  1. [1] Knott G.D., "A numbering system for binary trees", Comm. ACM20, 2, 1977, pp.113-115. Zbl0345.68025
  2. [2] Knuth D.E., The art of computer programming, Vol. 1: Fundamental algorithms, Reading Mass.Addison-Wesley, 1973. Zbl0302.68010MR378456
  3. [3] Rosenstiehl P., "Scaffold permutations", Discrete Math.75, 1989, pp.335-342. Zbl0668.05001MR1001406
  4. [4] Rotem D., and Varol Y.L., "Generation of binary trees from ballot sequences", J. AMC25, 1978, pp.396-404. Zbl0379.68029MR495167

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.