Skip to main content
SpringerLink
Log in

Left distance binary tree representations

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

We present a new scheme for representing binary trees. The scheme is based on rotations as a previous scheme of Zerling. In our method the items of a representation have a natural geometric interpretation, and the algorithms related to the method are simple. We give an algorithm for enumerating all the representations for trees onn nodes, and an algorithm for building the tree corresponding to a given representation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. M. Pallo,Enumerating, ranking and unranking binary trees, Computer J. 29 (1986), 171–175.

    Article  MathSciNet  Google Scholar 

  2. A. Proskurowski and F. Ruskey,Binary tree gray codes, J. Algorithms 6 (1985), 225–238.

    Google Scholar 

  3. F. Ruskey and T. C. Hu,Generating binary trees lexicographically, SIAM J. Comput. 6 (1977), 745–758.

    Article  Google Scholar 

  4. D. Zerling,Generating binary trees using rotations, J. ACM 32 (1985), 694–701.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Tampere, P.O. Box 607, SF-33101, Tampere, Finland

    Erkki Mäkinen

Authors
  1. Erkki Mäkinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Academy of Finland.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mäkinen, E. Left distance binary tree representations. BIT 27, 163–169 (1987). https://doi.org/10.1007/BF01934181

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934181

CR Categories

Search

Navigation