A survey in binary tree codings

DOI10.1093/COMJNL/34.5.438MaRDI QIDQ2740922zbMATH OpenOpenAlexFDO

Authors Erkki Mäkinen

Publication date 17 January 2002

Published in The Computer Journal. Section A Section B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/34.5.438

Mathematics Subject Classification ID

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

Cited in

(9)

• Rational languages defined with a non-associative concatenation
• Generating random binary trees -- a survey
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• An Eades-McKay algorithm for well-formed parentheses strings
• Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
• Coding Binary Trees by Words over an Alphabet with Four Letters
• Generating binary trees in A-order from codewords defined on a four-letter alphabet
• A constant amortized time algorithm for generating left-child sequences in lexicographic order

This page was built for publication: A survey in binary tree codings

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