Optimal binary search trees meet object-oriented programming

Authors:
Stuart Hansen;Lester I. McCann
Affiliations:
Computer Science Department, University of Wisconsin - Parkside, Kenosha, WI;Computer Science Department, University of Wisconsin - Parkside, Kenosha, WI
Venue:
Journal of Computing Sciences in Colleges
Year:
2002

Citing 8
Cited 0

Algorithms (2nd ed.)

Algorithms (2nd ed.)
Design patterns: elements of reusable object-oriented software

Design patterns: elements of reusable object-oriented software
Thinking about binary trees in an object-oriented world

SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Classic Data Structures in Java: A Visual and Explorational Approach

Classic Data Structures in Java: A Visual and Explorational Approach
Data Structures and Algorithms in Java with Cdrom

Data Structures and Algorithms in Java with Cdrom
Computer Algorithms: Introduction to Design and Analysis

Computer Algorithms: Introduction to Design and Analysis
Algorithms and object-oriented programming: bridging the gap

SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Introduction to Algorithms

Introduction to Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.