Generation of Binary Trees from Ballot Sequences

Cited in

(29)

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
Lexicographic generation of ordered trees
Stack sortable permutations
Loopless generation of \(k\)-ary tree sequences
On generating \(k\)-ary trees in computer representation
Generating 2-Gray codes for ballot sequences in constant amortized time
Counting and randomly generating binary trees
Noncontiguous pattern containment in binary trees
A basis for the non-crossing partition lattice top homology
Constant-memory iterative generation of special strings representing binary trees
On the generation ofP-sequences
Parallel generation of í-ary trees with ballot-sequences
A new algorithm for generation of different types of RNA
scientific article; zbMATH DE number 3900794 (Why is no real title available?)
A note on generating binary trees inA-order andB-order
On enumerating tree permutations in natural order
Generation of binary trees from (0-1) codes
Coding Binary Trees by Words over an Alphabet with Four Letters
On the generation of binary trees inA-order
On the generation of binary trees from (0–1) codes
Generation oft-ary trees with Ballot-sequences^*
Ranking trees generated by rotations
Greedy Gray codes for Dyck words and ballot sequences
Gray code generation of binary trees encoded in left-child sequences
Sur la génération des arbres binaires par les B-suites

This page was built for publication: Generation of Binary Trees from Ballot Sequences

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