Year: 1980
Type: article
Abstract: Gary Knott has presented algorithms for computing a bljectton between the set of binary trees on n nodes and an mmal segment of the posmve integers Rotem and Varol presented a more complicated algorithm that computes a different bljectmn, clmmmg that thetr algorithm is more efficient and has advantages ff a sequence of several consecutive trees is reqmred A modlficatmn of Knott's algorithm that ts simpler than Knott's and as effioent as Rotem and Varol's is presented Also given is a new hnear-time algorithm for transforming a tree mto ~ts successor m the natural ordering of binary trees
Source: Journal of the ACM
Authors: Marvin Solomon, Raphael A. Finkel
Institution: University of Wisconsin–Madison
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: binary trees, bijections, combinatorial generation
Open Access status: bronze
OpenAlex ID: W2005311123
