Skip to main content
SpringerLink
Log in

A comparison of iterative and defined classes of search trees

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

We initiate the study of iteratively defined classes of search trees, that is the classes of trees obtained by carrying out all possible iterative insertions into the initially empty tree, with respect to some given insertion scheme. For the well-known classes of search trees we compare their iteratively defined classes with their corresponding (statically) defined classes. Such a study sheds light on the properties of “average” trees in both classes.

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. R. Bayer and E. McCreight, “Organization and Maintenance of Large Ordered Indexes.”Acta Informatica 1:173–189 (1972).

    Google Scholar 

  2. K. Culik, II, Th. Ottmann, and D. Wood, “Dense Multiway Trees.”ACM Transactions on Database Systems 6:486–512 (1981).

    Google Scholar 

  3. C. C. Gotlieb and L. R. Gotlieb,Data Types and Structures (Prentice-Hall, Englewood Cliffs, N.J., 1978).

    Google Scholar 

  4. L. J. Guibas and R. Sedgewick, “A Dichromatic Framework for Balanced Trees.”Proceedings of the 19th IEEE FOCS Conference, pp. 8–21 (1978).

  5. D. E. Knuth,The Art of Computer Programming. Vol. 3: Sorting and Searching (Addison-Wesley, Mass., 1973).

    Google Scholar 

  6. J. Nievergelt and E. M. Reingold, “Binary Search Trees of Bounded Balance.”SIAM Journal of Computing 2:33–43 (1973).

    Google Scholar 

  7. H. Olivié,A Study of Balanced Binary Trees and Balanced One-Two Trees. Ph.D. Thesis, University of Antwerpen, 1980.

  8. Th. Ottman and M. Schrapp, “1-pass top-down update schemes for balanced search trees.” In:Proceedings of the 7th Conference on Graphtheoric Concepts in Computer Science (WG81), ed. J. R. Mühlbacher, (Carl Hanser Verlag, Wein, 1982), pp. 279–291.

    Google Scholar 

  9. Th. Ottman, H. W. Six, and D. Wood, “On the Correspondence Between AVL-Trees and Brother Trees.”Computing 23:43–54 (1979).

    Google Scholar 

  10. Th. Ottmann and D. Wood, “1–2 Brother Trees or AVL-Trees Revisited.”The Computer Journal 23:248–255 (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, Postfach 6380, D-7500, KARLSRUHE, West Germany

    Th. Ottman

  2. Department of Computer Science, University of Waterloo, N2L3G1, WATERLOO, Ontario, Canada

    D. Wood

Authors
  1. Th. Ottman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work of the first author was partially supported by the Deutsche Forschungsgemeinschaft and that of the second by a Natural Sciences and Engineering Research Council of Canada Grant A-7700.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ottman, T., Wood, D. A comparison of iterative and defined classes of search trees. International Journal of Computer and Information Sciences 11, 155–178 (1982). https://doi.org/10.1007/BF00999726

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation