A Survey on Binary Tree Codings
From MaRDI portal
Publication:2740922
DOI10.1093/comjnl/34.5.438zbMath0978.68515OpenAlexW2161534948MaRDI QIDQ2740922
Publication date: 17 January 2002
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/34.5.438
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (9)
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 ⋮ 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 ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Generating random binary trees -- a survey ⋮ Rational languages defined with a non-associative concatenation
This page was built for publication: A Survey on Binary Tree Codings
