Binary tree gray codes

DOI10.1016/0196-6774(85)90040-9zbMath0593.68050OpenAlexW2011105455MaRDI QIDQ3723712

Andrzej Proskurowski, Frank Ruskey

Publication date: 1985

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90040-9

zbMATH Keywords

Pascal programranking and unranking algorithmswell-formed parentheses strings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

On the generation of binary trees from (0–1) codes ⋮ Ranking trees generated by rotations ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Encoding trees by linear recurrence sequences ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ A loopless algorithm for generating binary tree sequences ⋮ Optimal binary search trees ⋮ Left distance binary tree representations ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Solution of some multi-dimensional lattice path parity difference recurrence relations ⋮ Unnamed Item ⋮ Gray codes for reflection groups