Generating binary trees using rotations

DOI10.1145/3828.214141zbMath0631.68061OpenAlexW2095382539MaRDI QIDQ3768417

David Zerling

Publication date: 1985

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3828.214141

zbMATH Keywords

lattice pathscodewordsfull binary treesextended binary treeslevel numberrotational geometry of binary treesunconstrained backtracking

Mathematics Subject Classification ID

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

Related Items (16)

A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ Loopless generation of \(k\)-ary tree sequences ⋮ On the loopless generation of binary tree sequences ⋮ Ranking trees generated by rotations ⋮ Loop Free Generation ofK-Ary Trees ⋮ Generating ordered trees ⋮ A loopless algorithm for generating binary tree sequences ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Left distance binary tree representations ⋮ Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems. ⋮ Generating strictly binary trees at random based on convex polygon triangulations ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Generating random binary trees -- a survey ⋮ An improved kernel size for rotation distance in binary trees ⋮ On generating \(k\)-ary trees in computer representation ⋮ Efficient loopless generation of Gray codes for \(k\)-ary trees.

This page was built for publication: Generating binary trees using rotations