A New Algorithm for Generating Binary Trees using Rotations

DOI10.1093/COMJNL/32.5.470MaRDI QIDQ3031919zbMATH OpenOpenAlexFDO

Authors M. C. Er

Publication date 1989

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/32.5.470

zbMATH Keywords

binary treescodewordsrotational-admissible codewordstree rotationsZerling's algorithms

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Recommendations

• Generating binary trees using rotations
• On Rotations and the Generation of Binary Trees
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• On the generation of binary trees from (0–1) codes
• Generation of binary trees from (0-1) codes

Cited in

(7)

• Generating binary trees using rotations
• The rotation graph of binary trees is Hamiltonian
• On Rotations and the Generation of Binary Trees
• Optimal binary search trees
• On 0-rotatable trees
• scientific article; zbMATH DE number 4091527 (Why is no real title available?)
• Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems.

This page was built for publication: A New Algorithm for Generating Binary Trees using Rotations

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