A numbering system for binary trees

DOI10.1145/359423.359434zbMath0345.68025OpenAlexW1974139773MaRDI QIDQ4114762

Gary 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)

Related Items (36)

Counting and randomly generating binary trees ⋮ A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ Loopless generation of \(k\)-ary tree sequences ⋮ Ranking trees generated by rotations ⋮ CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES ⋮ Efficient generation of binary trees from inorder-postorder sequences ⋮ On random and adaptive parallel generation of combinatorial objects ⋮ Generation of binary trees from (0-1) codes ⋮ Generating ordered trees ⋮ Generating t-ary trees in A-order ⋮ A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗ ⋮ Two algorithms for constructing a binary tree from its traversals ⋮ On the generation ofP-sequences ⋮ Coding Binary Trees by Words over an Alphabet with Four Letters ⋮ Lexicographic generation of ordered trees ⋮ Generating binary trees in A-order from codewords defined on a four-letter alphabet ⋮ Clean Reversible Simulations of Ranking Binary Trees ⋮ The complexity of drawing trees nicely ⋮ A note on generating binary trees inA-order andB-order ⋮ On enumerating tree permutations in natural order ⋮ Generating binary trees at random ⋮ Unnamed Item ⋮ A new algorithm for generation of different types of RNA ⋮ Optimal binary search trees ⋮ Counting labels in binary trees ⋮ Generating binary trees with uniform probability ⋮ Constructing a binary tree from its traversals ⋮ Efficient algorithms for tree reconstruction ⋮ 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 ⋮ A linear time and space algorithm for finding isomorphic subtrees of a binary tree ⋮ Generating binary trees of bounded height ⋮ On generating \(k\)-ary trees in computer representation ⋮ The generation of random, binary unordered trees ⋮ Lexicographic Enumeration of k-ary Trees

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