Skip to main content
Log in

Counting labels in binary trees

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

Abstract

We investigate properties of binary (search) trees related to the “inorder” labelling of the nodes. Both permutation and uniform trees are considered. We give explicit formulas to count the number of interior, middle and final nodes (leaves) containing a specific label. Possible applications are discussed.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Brinck K.:The expected performance of traversal algorithms in binary trees. The Computer J., 28, 4 (1985), p. 426–432.

    Article  Google Scholar 

  2. Brinck K.:On deletions in threaded binary trees. Journal of Algorithms, 7 (1986), p. 395–411.

    Article  MathSciNet  Google Scholar 

  3. Knott D. G.:A numbering system for binary trees. Comm. of the ACM, 20, 2 (1977), p. 113–115.

    Article  Google Scholar 

  4. Knuth D. E.:The Art of Computer Programming. Vol. 1.Fundamental Algorithms. Addison Wesley, Reading, Ma. (1968).

    Google Scholar 

  5. Sprugnoli R.:On the allocation of binary trees to secondary storage. BIT, 21 (1981) p. 305–316.

    Google Scholar 

  6. Sprugnoli R.:The generation of binary trees as a numerical problem. (To appear.)

  7. Trojanowski A. E.:Ranking and listing algorithms for k-aray trees, SIAM J. of Comp. 7 (1978) pp. 492–519.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported by the Italian Ministry for Public Education.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sprugnoli, R. Counting labels in binary trees. BIT 30, 62–69 (1990). https://doi.org/10.1007/BF01932132

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

CR categories

Keywords

Navigation