Generating Binary Trees Lexicographically
From MaRDI portal
Publication:4142685
DOI10.1137/0206055zbMath0366.68027OpenAlexW2039339864WikidataQ56534626 ScholiaQ56534626MaRDI QIDQ4142685
No author found.
Publication date: 1977
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0206055
Related Items (33)
On the generation of binary trees from (0–1) codes ⋮ Average cost of Duval's algorithm for generating Lyndon words ⋮ The pruning-grafting lattice of binary trees ⋮ Efficient generation of binary trees from inorder-postorder sequences ⋮ Loop Free Generation ofK-Ary Trees ⋮ On random and adaptive parallel generation of combinatorial objects ⋮ Generating ordered trees ⋮ On the generation ofP-sequences ⋮ Coding Binary Trees by Words over an Alphabet with Four Letters ⋮ Lexicographic generation of ordered trees ⋮ The average height of r-tuply rooted planted plane trees ⋮ Generating binary trees in A-order from codewords defined on a four-letter alphabet ⋮ Enumerations of ordered trees ⋮ Encoding trees by linear recurrence sequences ⋮ A note on generating binary trees inA-order andB-order ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ A loopless algorithm for generating binary tree sequences ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Optimal binary search trees ⋮ Left distance binary tree representations ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Patterns in trees ⋮ Unnamed Item ⋮ On Level Numbers of t-Ary Trees ⋮ A simple proof of a formula of Dershowitz and Zaks ⋮ Listing and counting subtrees of equal size of a binary tree ⋮ Sur la génération des arbres binaires par les B-suites ⋮ Permutation representation of k-ary trees ⋮ Generating binary trees of bounded height ⋮ On generating B-trees with constant average delay and in lexicographic order ⋮ The generation of random, binary unordered trees ⋮ An efficient upper bound of the rotation distance of binary trees ⋮ On the Average Shape of Binary Trees
This page was built for publication: Generating Binary Trees Lexicographically
