Skip to main content
SpringerLink
Log in
Book cover

Abstract Data Types and Algorithms pp 91–135Cite as

Non-linear ADTs—Trees

  • Chapter

  • 67 Accesses

Part of the book series: Macmillan Computer Science Series

Abstract

In linear abstract data types, there exists exactly one previous and one next element for each element of the ADT (except the first and last elements). In non-linear structures, such a linear ordering does not exist among the components of the structure. The first non-linear structure which we shall study is the ADT tree.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographic Notes and Further Reading

  • ACM (1984). ACM-SIGMOID, Vol. 14, No. 2.

    Google Scholar 

  • Adel’son-Velskii, G. M. and Landis, Y. M. (1962). ‘An algorithm for the representation of information’, Soviet Math., Vol. 3, pp. 1259–1262.

    Google Scholar 

  • Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1983). Data Structures and Algorithms, Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  • Aho, A V., Sethi, R. and Ullman, J. P. (1986) Compilers — Principles, Techniques and Tools, Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  • Bayer, R. and McCreight, C. (1972). ‘Organisation and maintenance of large ordered indexes’, Acta Informatica, Vol. 1, No. 3, pp. 173–189.

    Article  Google Scholar 

  • Comer, D. (1979). ‘The ubiquitous B-tree’, ACM Computing Surveys, Vol. 11, No. 2, June, p. 121.

    Article  Google Scholar 

  • Date, C. J. (1985). Introduction to Database Systems, Vol 1, 4th edition, Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  • Eppinger, J. (1983). ‘An empirical study of insertion and deletion in binary search trees’, CACM, Vol. 26, No. 9, September, pp. 663–670.

    Article  Google Scholar 

  • Gonnet, G. H. (1983). ‘Balancing binary trees by internal path reductions’, CACM, Vol. 26, No. 12, December, pp. 1074–1082.

    Article  Google Scholar 

  • Stout, Q. F. and Warren, B. L. (1986). ‘Tree rebalancing in optimal time and space’, CACM, Vol. 29, No. 9 pp. 902–908.

    Article  Google Scholar 

  • Wirth, N. (1976). Algorithms + Data Structures = Programs, Prentice-Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. British Telecom Research Laboratories, Scottish Mutual House, Lower Brook Street, Ipswich, UK

    Manoochehr Azmoodeh

Authors
  1. Manoochehr Azmoodeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Copyright information

© 1990 Manoochehr Azmoodeh

About this chapter

Cite this chapter

Azmoodeh, M. (1990). Non-linear ADTs—Trees. In: Abstract Data Types and Algorithms. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-21151-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-21151-7_4

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-51210-4

  • Online ISBN: 978-1-349-21151-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation