Counting labels in binary trees

DOI10.1007/BF01932132zbMath0692.68018OpenAlexW2069779156MaRDI QIDQ583877

Renzo Sprugnoli

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932132

zbMATH Keywords

permutation treestree labellinguniform trees

Mathematics Subject Classification ID

Data structures (68P05) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Unnamed Item
• On the allocation of binary trees to secondary storage
• The Expected Performance of Traversal Algorithms in Binary Trees
• On deletion in threaded binary trees
• A numbering system for binary trees
• Ranking and Listing Algorithms for k-Ary Trees
• The generation of binary trees as a numerical problem