Left distance binary tree representations

DOI10.1007/BF01934181zbMath0978.68514MaRDI QIDQ5943012

Erkki Maekinen

Publication date: 17 January 2002

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (7)

On the rotation distance between binary trees ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ A loopless algorithm for generating binary tree sequences ⋮ Optimal binary search trees ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Descent distribution on Catalan words avoiding a pattern of length at most three ⋮ Generating random binary trees -- a survey

Cites Work

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

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