Generation of Binary Trees from Ballot Sequences
From MaRDI portal
Publication:4158474
DOI10.1145/322077.322082zbMath0379.68029OpenAlexW2080441570MaRDI QIDQ4158474
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322077.322082
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Algorithms in computer science (68W99)
Related Items
On the generation of binary trees inA-order, On the generation of binary trees from (0–1) codes, Counting and randomly generating binary trees, 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, Generation of binary trees from (0-1) codes, On the generation ofP-sequences, Coding Binary Trees by Words over an Alphabet with Four Letters, Lexicographic generation of ordered trees, Stack sortable permutations, Noncontiguous pattern containment in binary trees, A note on generating binary trees inA-order andB-order, On enumerating tree permutations in natural order, Unnamed Item, A new algorithm for generation of different types of RNA, A basis for the non-crossing partition lattice top homology, Generation oft-ary trees with Ballot-sequences*, Parallel generation of í-ary trees with ballot-sequences, Generating 2-Gray codes for ballot sequences in constant amortized time, 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, Generating binary trees of bounded height, On generating \(k\)-ary trees in computer representation, The generation of random, binary unordered trees
