Generation of Binary Trees from Ballot Sequences
From MaRDI portal
Publication:4158474
Cited in
(28)- Generation oft-ary trees with Ballot-sequences*
- A note on generating binary trees inA-order andB-order
- On the generation of binary trees from (0–1) codes
- Efficient generation of binary trees from inorder-postorder sequences
- Coding Binary Trees by Words over an Alphabet with Four Letters
- 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
- Parallel generation of í-ary trees with ballot-sequences
- scientific article; zbMATH DE number 3900794 (Why is no real title available?)
- Greedy Gray codes for Dyck words and ballot sequences
- On enumerating tree permutations in natural order
- Counting and randomly generating binary trees
- On the generation of binary trees inA-order
- Generation of binary trees from (0-1) codes
- Lexicographic generation of ordered trees
- Stack sortable permutations
- Loopless generation of \(k\)-ary tree sequences
- A basis for the non-crossing partition lattice top homology
- On generating \(k\)-ary trees in computer representation
- Listing and counting subtrees of equal size of a binary tree
- Ranking trees generated by rotations
- Permutation representation of k-ary trees
- The generation of random, binary unordered trees
- Noncontiguous pattern containment in binary trees
- Sur la génération des arbres binaires par les B-suites
- Generating binary trees of bounded height
- Generating 2-Gray codes for ballot sequences in constant amortized time
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)
