Frank Ruskey and Andrzej Proskurowski (1990) developed a recursive algorithm for generating binary trees as represented by bitstrings with a given prefix, such that successive bitstrings differ by the trans-position of two bits and the concatenation of generated lists forms a Gray code. This paper presents a new Gray code for the set of all such bitstrings and an algorithm for directly generating binary trees represented by Zaks sequences.
bitstrings, generating algorithms, Gray codes, trees.
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).