A Note on Enumerating Binary Trees

Marvin Solomon, Raphael A. Finkel

Research output: Contribution to journalArticlepeer-review

45 Scopus citations


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 languageEnglish
Pages (from-to)3-5
Number of pages3
JournalJournal of the ACM (JACM)
Issue number1
StatePublished - Jan 1 1980


  • 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


Dive into the research topics of 'A Note on Enumerating Binary Trees'. Together they form a unique fingerprint.

Cite this