Left distance binary tree representations

DOI10.1007/BF01934181MaRDI QIDQ5943012zbMATH OpenFDO

Authors Erkki Mäkinen

Publication date 17 January 2002

Published in BIT (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Binary tree gray codes
• Enumerating, Ranking and Unranking Binary Trees
• Generating Binary Trees Lexicographically
• Generating binary trees using rotations

Cited in

(9)

• A loopless algorithm for generating binary tree sequences
• Generating random binary trees -- a survey
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
• Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
• Optimal binary search trees
• Gray code generation of binary trees encoded in left-child sequences
• Descent distribution on Catalan words avoiding a pattern of length at most three
• Combinatorial proofs of totals of some statistics on Catalan words
• On the rotation distance between binary trees

This page was built for publication: Left distance binary tree representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943012)