A note on generating binary trees inA-order andB-order
From MaRDI portal
Publication:3802638
DOI10.1080/00207168508803477zbMath0655.68080OpenAlexW1998997565MaRDI QIDQ3802638
No author found.
Publication date: 1985
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168508803477
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (24)
On the generation of binary trees inA-order ⋮ Chains with Small Intervals in the Lattice of Binary Paths ⋮ On the generation of binary trees from (0–1) codes ⋮ Two shortest path metrics on well-formed parentheses strings ⋮ Loopless generation of \(k\)-ary tree sequences ⋮ Matchings In Three Catalan Lattices ⋮ CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES ⋮ Generation of binary trees from (0-1) codes ⋮ Generating t-ary trees in A-order ⋮ A note on the generation of binary trees ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ On the generation ofP-sequences ⋮ 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 ⋮ Unnamed Item ⋮ Ranking and Unranking of Non-regular Trees ⋮ The number of coverings in four catalan lattices ⋮ Generating trees withnnodes andmleaves ⋮ A new algorithm for generation of different types of RNA ⋮ Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems. ⋮ Generation oft-ary trees with Ballot-sequences* ⋮ Parallel generation of í-ary trees with ballot-sequences ⋮ Rational languages defined with a non-associative concatenation ⋮ On generating \(k\)-ary trees in computer representation
Cites Work
- Unnamed Item
- Unnamed Item
- Sur la génération des arbres binaires par les B-suites
- Lexicographic generation of ordered trees
- Enumerations of ordered trees
- Enumerations of rooted trees with an application to group presentations
- On a correspondence between binary trees and a certain type of permutation
- A Note on Generating Well-formed Parenthesis Strings Lexicographically
- Constant Time Generation of Rooted Trees
- A numbering system for binary trees
- Generating Binary Trees Lexicographically
- Generation of Binary Trees from Ballot Sequences
- Ranking and Listing Algorithms for k-Ary Trees
- Generating Trees and Other Combinatorial Objects Lexicographically
- Ranking and unranking of B-trees
This page was built for publication: A note on generating binary trees inA-order andB-order
