On the generation of binary trees inA-order

DOI10.1080/00207169908804813zbMath0926.68097OpenAlexW2060664390MaRDI QIDQ4254656

No author found.

Publication date: 29 November 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804813

zbMATH Keywords

\(A\)-sequences

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees ⋮ Unnamed Item

Cites Work

• Lexicographic generation of ordered trees
• Generating binary trees by transpositions
• Enumerating, Ranking and Unranking Binary Trees
• A note on generating binary trees inA-order andB-order
• Generation of Binary Trees from Ballot Sequences
• On Rotations and the Generation of Binary Trees
• A note on the generation of binary trees

This page was built for publication: On the generation of binary trees inA-order