Optimal binary search trees meet object-oriented programming

Abstract

This paper presents an object-oriented approach to the problem of finding optimal binary search trees. We show that object-oriented techniques produce a solution that is an improvement over those created procedurally and that is well within the reach of our undergraduate students. Combining the study of optimality with that of object-oriented design helps the students gain a deeper appreciation of both.

References

1. {1} Baase, S., and Gelder, A. Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, 2000.
2. {2} Berman, A. M., and Duvall, R. C. Thinking about binary trees in an object-oriented world. SIGCSE Bulletin 28 (1996), 185-189.
3. {3} Bucci, P., Heym, W., Long, T., and Weide, B. Algorithms and object-oriented programming: Bridging the gap. Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education (2002), 302-306.
4. {4} Budd, T. Classic Data Structures in Java. Addison-Wesley, 2001.
5. {5} Cormen, T., Leiserson, C., Rivest, R., and Stein, C. Introduction to Algorithms, 2nd ed. MIT Press, 2001.
6. {6} Gamma, E., Helm, R., Johnson, R., and Vlissides, J. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.
7. {7} Goodrich, M., and Tamassia, R. Data Structures and Algorithms in Java. Wiley, 1998.
8. {8} Sedgewick, R. Algorithms, 2nd ed. Addison-Wesley, 1988.

Index Terms

• Mathematics of computing

  • Discrete mathematics

    • Graph theory

      • Trees

• Software and its engineering

  • Software notations and tools

    • General programming languages

      • Language types

        • Object oriented languages

• Theory of computation

  • Design and analysis of algorithms

    • Data structures design and analysis

      • Sorting and searching

  • Randomness, geometry and discrete structures