The Unbounded BB Tree

  • Charles Lins
Part of the Springer Compass International book series (COMPASS)


This chapter presents the unbounded form of the weight-balanced binary search tree further described in §7.1. The interface is also presented in §7.1 while its implementation follows in §7.2. The chapter concludes with a utility module in §7.3 and §7.4.


Tree Object Source Tree Exception Handler Exception Condition External Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison- Wesley, Reading, MA 1983.MATHGoogle Scholar
  2. [2]
    G. Booch, Software Components in Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.Google Scholar
  3. [3]
    G.H. Gönnet, Handbook of Algorithms and Data Structures, Addison-Wesley, Reading, MA 1984.Google Scholar
  4. [4]
    K. John Gough, Writing Generic Utilities in Modula-2. Journal of Pascal, Ada, and Modula-2, Vol. 5(3), (May/June 1986 ), pp 53–62.Google Scholar
  5. [5]
    T.A. Standish, Data Structure Techniques, Addison-Wesley, Reading, MA 1980.Google Scholar
  6. [6]
    R.S. Wiener and G. A. Ford, Modula-2 A Software Development Approach, John Wiley & Sons, New York, NY 1985.Google Scholar
  7. [7]
    R.S. Wiener and R.F. Sincovec, Data Structures Using Modula-2, John Wiley & Sons, New York, NY 1986.Google Scholar
  8. [8]
    N. Wirth, Algorithms and Data Structures, Prentice-Hall, Englewood Cliffs, NJ 1986.MATHGoogle Scholar
  9. [9]
    N. Wirth, Programming in Modula-2, 3rd corrected edition, Springer-Verlag, New York, NY 1985.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • Charles Lins
    • 1
  1. 1.Apple Computer, Inc.CupertinoUSA

Personalised recommendations