Enumerating, Ranking and Unranking Binary Trees
From MaRDI portal
Publication:3709911
DOI10.1093/comjnl/29.2.171zbMath0585.68066OpenAlexW2010788995MaRDI QIDQ3709911
No author found.
Publication date: 1986
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/29.2.171
Related Items
On the generation of binary trees inA-order ⋮ A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ Loopless generation of \(k\)-ary tree sequences ⋮ On the loopless generation of binary tree sequences ⋮ A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Three Fuss-Catalan posets in interaction and their associative algebras ⋮ The pruning-grafting lattice of binary trees ⋮ Matchings In Three Catalan Lattices ⋮ Efficient lower and upper bounds of the diagonal-flip distance between triangulations ⋮ The Tamari block lattice: an order on saturated chains in the Tamari lattice ⋮ Loop Free Generation ofK-Ary Trees ⋮ A direct algorithm for restricted rotation distance ⋮ A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗ ⋮ An efficient algorithm for estimating rotation distance between two binary trees ⋮ Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Catalan intervals and uniquely sorted permutations ⋮ 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 ⋮ Effective splaying with restricted rotations ⋮ Ranking and unranking bordered and unbordered words ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Recursive constructions for the higher Stasheff-Tamari orders in dimension three using the outer Tamari and Tamari block posets ⋮ Geometric realizations of Tamari interval lattices via cubic coordinates ⋮ A catalanization map on the symmetric group ⋮ Three interacting families of Fuss-Catalan posets ⋮ A distance metric on binary trees using lattice-theoretic measures ⋮ Ranking and Unranking of Non-regular Trees ⋮ On a subposet of the Tamari lattice ⋮ Generating trees withnnodes andmleaves ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ A loopless algorithm for generating binary tree sequences ⋮ A decidable word problem without equivalent canonical term rewriting system ⋮ Shellable nonpure complexes and posets. II ⋮ Algebraic and combinatorial structures on pairs of twin binary trees ⋮ Unnamed Item ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Optimal binary search trees ⋮ Gray codes for reflectable languages ⋮ Left distance binary tree representations ⋮ Further bijections to pattern-avoiding valid hook configurations ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Weak associativity and restricted rotation ⋮ The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes ⋮ Generating binary trees by Glivenko classes on Tamari lattices ⋮ Right-arm rotation distance between binary trees ⋮ Cubic realizations of Tamari interval lattices ⋮ Generating random binary trees -- a survey ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ A Motzkin filter in the Tamari lattice ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously ⋮ An algorithm to compute the möbius function of the rotation lattice of binary trees ⋮ On generating \(k\)-ary trees in computer representation ⋮ An efficient upper bound of the rotation distance of binary trees ⋮ Efficient loopless generation of Gray codes for \(k\)-ary trees.
