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 its successor m the natural ordering of binary trees.
| Original language | English |
|---|---|
| Pages (from-to) | 3-5 |
| Number of pages | 3 |
| Journal | Journal of the ACM (JACM) |
| Volume | 27 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1 1980 |
Keywords
- binary trees
- combmatortcs
- enumeratmn
- generators
- permutations
- permutations
- stack-sortable
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Information Systems
- Hardware and Architecture
- Artificial Intelligence