A numbering system for binary trees

DOI10.1145/359423.359434MaRDI QIDQ4114762zbMATH OpenOpenAlexFDO

Authors G. D. Knott

Publication date 1977

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359423.359434

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited in

(41)

• Simple random sampling of binary forests with fixed number of nodes and trees
• A note on generating binary trees inA-order andB-order
• Pattern-avoiding binary trees -- generation, counting, and bijections
• Efficient generation of binary trees from inorder-postorder sequences
• Coding Binary Trees by Words over an Alphabet with Four Letters
• Gray code generation of binary trees encoded in left-child sequences
• Generating ordered trees
• On the generation ofP-sequences
• A new algorithm for generation of different types of RNA
• Constant-memory iterative generation of special strings representing binary trees
• scientific article; zbMATH DE number 3900794 (Why is no real title available?)
• Counting labels in binary trees
• On enumerating tree permutations in natural order
• Counting and randomly generating binary trees
• Simple random sampling of binary forests with fixed number of nodes and trees
• Generating binary trees in A-order from codewords defined on a four-letter alphabet
• A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗
• Generation of binary trees from (0-1) codes
• Optimal binary search trees
• Combinatorial generation via permutation languages. VI: Binary trees
• Generating binary trees at random
• Generating t-ary trees in A-order
• Lexicographic generation of ordered trees
• Loopless generation of \(k\)-ary tree sequences
• Generating binary trees with uniform probability
• On random and adaptive parallel generation of combinatorial objects
• On generating \(k\)-ary trees in computer representation
• Two algorithms for constructing a binary tree from its traversals
• Clean reversible simulations of ranking binary trees
• Listing and counting subtrees of equal size of a binary tree
• Efficient algorithms for tree reconstruction
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• Ranking trees generated by rotations
• Permutation representation of k-ary trees
• The generation of random, binary unordered trees
• A linear time and space algorithm for finding isomorphic subtrees of a binary tree
• Lexicographic Enumeration of k-ary Trees
• The complexity of drawing trees nicely
• Constructing a binary tree from its traversals
• Sur la génération des arbres binaires par les B-suites
• Generating binary trees of bounded height

This page was built for publication: A numbering system for binary trees

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