Binary Search Trees

A binary search tree is a binary tree with the following properties.
- There is a total order relation on the members in the tree.
- At every node, every member of the left subtree is less than or equal to the node value.
- At every node, every member of the right subtree is greater than or equal to the node value.
The BinarySearchTree class is implemented as a subclass of the BinaryTree class.

Binary Search Tree Interface (in addition to inherited functions)

Mutators

    void Insert(const T& value);
    bool Delete(const T& value);

Other member functions

    T* Search(const T& value) const;
    void CountBalance()

This page was last modified on Apr 10, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/BinarySearchTrees.html