Generating Binary Trees Lexicographically

DOI10.1137/0206055MaRDI QIDQ4142685zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

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

Mathematics Subject Classification ID

Trees (05C05) Algorithms in computer science (68W99)

Cited in

(36)

• Listing and counting subtrees of equal size of a binary tree
• Permutation representation of k-ary trees
• Generating binary trees of bounded height
• The generation of random, binary unordered trees
• Efficient generation of binary trees from inorder-postorder sequences
• Generating ordered trees
• Lexicographic generation of ordered trees
• The average height of r-tuply rooted planted plane trees
• Enumerations of ordered trees
• A loopless algorithm for generating binary tree sequences
• On generating B-trees with constant average delay and in lexicographic order
• Average cost of Duval's algorithm for generating Lyndon words
• An efficient upper bound of the rotation distance of binary trees
• Encoding trees by linear recurrence sequences
• A simple proof of a formula of Dershowitz and Zaks
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
• Patterns in trees
• The pruning-grafting lattice of binary trees
• On the generation ofP-sequences
• On Level Numbers of t-Ary Trees
• A note on generating binary trees inA-order andB-order
• On the Average Shape of Binary Trees
• On random and adaptive parallel generation of combinatorial objects
• Coding Binary Trees by Words over an Alphabet with Four Letters
• On the generation of binary trees from (0–1) codes
• scientific article; zbMATH DE number 706769 (Why is no real title available?)
• 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
• Loop Free Generation ofK-Ary Trees
• Ranking and unranking of non-regular trees with a prescribed branching sequence
• Optimal binary search trees
• Left distance binary tree representations
• An explicit 16-stage Runge-Kutta method of order 10 discovered by numerical search
• Gray code generation of binary trees encoded in left-child sequences
• Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
• Sur la génération des arbres binaires par les B-suites

This page was built for publication: Generating Binary Trees Lexicographically

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