Skip to main content
SpringerLink
Log in

Generalized binary split trees

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The definition of binary split trees is generalized by removing the condition of decreasing frequency. It is shown that the access time of generalized split trees is less than that of split trees in general. The optimal representation of generalized split trees is studied. A polynomial time algorithm to construct such optimal tree structures is given. The relationship among several classes of binary trees are also discussed.

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. Comer, D.: A Note on Median Split Trees. ACM Trans. on Programming Languages and Systems, 2 (1), pp. 129–133 (1980)

    Google Scholar 

  2. Gotlieb, L., Wood, D.: The Construction of Optimal Multiway Search Trees and the Monotonicity Principle. McMaster University, Computer Science Technical Report 79-CS-18, Canada, 1979

  3. Huang, S., Wong, C.K.: Optimal Binary Split Trees. Technical Report #UH-CS-82-8, Department of Computer Science, University of Houston, May 1982, to appear in J. Algorithms

  4. Knuth, D.E.: The Art of Computer Programming, Vol. 1. Reading, Mass.: Addison-Wesley 1968

    Google Scholar 

  5. Knuth, D.E.: Optimal Binary Search Trees. Acta Informat. 1, 14–25 (1971)

    Google Scholar 

  6. Knuth, D.E.: The Art of Computer Programming, Vol. 3. Reading, Mass.: Addison-Wesley 1973

    Google Scholar 

  7. Mehlhorn, K.: Nearly Optimal Binary Search Trees. Acta Informat. 5, 287–295 (1975)

    Google Scholar 

  8. Sheil, B.A.: Median Split Trees: A Fast Lookup Technique for Frequency Occurring Keys. Comm. ACM, 21(11), 947–958 (1978)

    Google Scholar 

  9. Yao, F.F.: Efficient Dynamic Programming Using Quadrangle Inequalities. The 12th Annual ACM Symposium on Theory of Computing, pp. 426–435, 1980

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Houston, 77004, Houston, TX, USA

    Shou -Hsuan Stephen Huang

  2. IBM T.J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, NY, USA

    C. K. Wong

Authors
  1. Shou -Hsuan Stephen Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. K. Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research of the first author was partially supported by a Research Initiation Grant from the University of Houston

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stephen Huang, S.H., Wong, C.K. Generalized binary split trees. Acta Informatica 21, 113–123 (1984). https://doi.org/10.1007/BF00289143

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation