Skip to main content
SpringerLink
Log in

Dynamic weighted binary search trees

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We present an algorithm which optimizes a weighted binary tree after an insertion or deletion. The resulting tree is nearly optimal. The algorithm needs O(n) space. In the case of an insertion the expected number of operations is equal to or less than the height of the tree. All results presented in this paper can also be found in [15].

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.

Similar content being viewed by others

References

  1. Adelson-Velskii, G.M., Landis, E.M.: An Algorithm for the Organization of Information. Doklady Akademii Nauk USSR, Moscow, Vol. 16, No. 2, 1962, pp. 263–266; english translation in Soviet Mathematics, Vol. 3, 1259–1263 (1962)

    Google Scholar 

  2. Baer, J.-L.: Weight-balanced trees. Proc. AFIPS, Vol. 44, 467–472 (1975)

    Google Scholar 

  3. Bayer, P.J.: Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees. M. Sc. thesis, MIT, 1975

  4. Bayer, R.: Symmetric binary B-trees: data structure and maintenance algorithms. Acta Informat. 1, 290–306 (1972)

    Google Scholar 

  5. Foster, C.C.: Information storage and retrieval using AVL-trees. Proceedings of the 20th National ACM Conference at Cleveland, 1965, pp. 192–205

  6. Fredman, M.L.: Two Applications of a Probabilistic Search Technique: Sorting X + Y and building Balanced Search Trees. Proceedings of Seventh Annual ACM Symposium on Theory of Computing, Albuquerque, New Mexico, May 1975, pp. 240–244

    Google Scholar 

  7. Knott, G.D.: A balanced tree structure and retrieval algorithm. Proceedings of Symposium on Information Storage and Retrieval, University of Maryland, 1971, pp. 175–196

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

    Google Scholar 

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

    Google Scholar 

  10. Maurer, H.A., Wood, D.: Zur Manipulation von Zahlenmengen. Angewandte Informatik 4, 143–149 (1976)

    Google Scholar 

  11. Mehlhorn, K.: Dynamic binary search. Proceedings of the Fourth Colloquium on Automata, Languages and Programming, University of Turku, July 18–22, 1977, pp. 323–336

  12. Mehlhorn, K.: Nearly optimal binary search trees. Acta Informat. 5, 287–295 (1975)

    Google Scholar 

  13. Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. Siam Journal on Computing 2, (1) 33–43 (1973)

    Google Scholar 

  14. Ottmann, Th., Six, H.-W.: Eine neue Klasse von ausgeglichenen Binärbäumen. Angewandte Informatik 8, 395–400 (1976)

    Google Scholar 

  15. Unterauer, K.: Optimierung gewichteter Binärbäume zur Organisation geordneter, dynamischer Dateien. Technische Universität München, Report No. 7730, August 1977

Download references

Author information

Authors and Affiliations

  1. Siemens AG, Abteilung D APS1, Otto-Hahn-Ring 6, 8000, München 83, Germany (Fed. Rep.)

    Karl Unterauer

Authors
  1. Karl Unterauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Unterauer, K. Dynamic weighted binary search trees. Acta Informatica 11, 341–362 (1979). https://doi.org/10.1007/BF00289093

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation