caa a22 4500 465821014 CHVBK 20180323112135.0 cr unu---uuuuu 170327e19900301xx s 000 0 eng 10.1007/BF01932132 doi (NATIONALLICENCE)springer-10.1007/BF01932132 Sprugnoli Renzo Dipartimento di Matematica Pura è Applicata, Via Belzoni, 7, 1 35131, Padova, Italy aut Counting labels in binary trees [Elektronische Daten] [Renzo Sprugnoli] We investigate properties of binary (search) trees related to the "inorder” labelling of the nodes. Both permutation and uniform trees are considered. We give explicit formulas to count the number of interior, middle and final nodes (leaves) containing a specific label. Possible applications are discussed. BIT Foundations, 1990 E.1 nationallicence G.2.1 nationallicence Permutation trees nationallicence Uniform trees nationallicence Tree labelling nationallicence BIT Numerical Mathematics Kluwer Academic Publishers 30/1(1990-03-01), 62-69 0006-3835 30:1<62 1990 30 10543 https://doi.org/10.1007/BF01932132 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF01932132 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Sprugnoli Renzo Dipartimento di Matematica Pura è Applicata, Via Belzoni, 7, 1 35131, Padova, Italy aut NATIONALLICENCE 773 0- BIT Numerical Mathematics Kluwer Academic Publishers 30/1(1990-03-01), 62-69 0006-3835 30:1<62 1990 30 10543 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer