Skip to main content
SpringerLink
Log in

Extremal cost tree data structures

  • Conference paper
  • First Online:
SWAT 88 (SWAT 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 318))

Included in the following conference series:

  • 154 Accesses

Abstract

Given a cost measure for some class of trees, we are interested in characterizing the trees that attain the minimal or maximal cost amongst all trees of the same size. We present our latest results in this area for the classes of AVL trees and brother trees, and for the cost measures based on binary comparisons and node visits. We also briefly consider the space cost measure for brother trees and the unbalance cost measure for AVL trees.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.H. Gonnet. Balancing binary trees by internal path reduction. Communications of the ACM, 26:1074–1081, 1983.

    Google Scholar 

  2. R. Klein and D. Wood. The node visit cost of brother trees. Information and Control, 75:107–129, 1987.

    Google Scholar 

  3. R. Klein and D. Wood. A Tight Upper Bound for the Path Length of AVL Trees. Technical Report, Department of Computer Science, University of Waterloo, 1987.

    Google Scholar 

  4. D.E. Knuth. The Art of Computer Programming, Vol.3: Sorting and Searching. Addison-Wesley Publishing Co., Reading, Mass., 1973.

    Google Scholar 

  5. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, New York, 1984.

    Google Scholar 

  6. R.E. Miller, N.J. Pippenger, A.L. Rosenberg, and L. Snyder. Optimal 2,3-trees. SIAM Journal on Computing, 8:42–59, 1979.

    Google Scholar 

  7. Th. Ottmann, D.St. Parker, A.L. Rosenberg, H.-W. Six, and D. Wood. Minimal-cost brother trees. SIAM Journal on Computing, 13:197–217, 1984.

    Google Scholar 

  8. Th. Ottmann, H.-W. Six, and D. Wood. On the correspondence between AVL trees and brother trees. Computing, 23:43–54, 1979.

    Google Scholar 

  9. Th. Ottmann and D. Wood. 1–2 brother trees or AVL trees revisited. Computer Journal, 23:248–255, 1981.

    Google Scholar 

  10. A.L. Rosenberg and L. Snyder. Minimal comparison 2,3-trees. SIAM Journal on Computing, 7:465–480, 1978.

    Google Scholar 

  11. A.L. Rosenberg and L. Snyder. Time-and space-optimality in B-trees. ACM Transactions on Database Systems, 6:174–183, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Data Structuring Group Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Derick Wood

Authors
  1. Derick Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf Karlsson Andrzej Lingas

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wood, D. (1988). Extremal cost tree data structures. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-19487-8_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19487-3

  • Online ISBN: 978-3-540-39288-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation