CMSC-341, Fall 1999, Sections 0101
BST.H (1 of 2)
<![CDATA[
template <class Comparable>
class BST
{
public:
BST (const Comparable & notFound);
BST (const BST & rhs);
~BST ( );
const Comparable & findMin ( ) const;
const Comparable & findMax ( ) const;
const Comparable & find (const Comparable & x ) const;
void insert (const Comparable & x);
void remove (const Comparable & x);
const BST & operator= (const BST & rhs);
bool isEmpty ( ) const;
void printTree ( ) const;
void makeEmpty ( ) const;
]]>
Wednesday, 05-Jan-2000 15:43:43 EST
Sorry! We could not find what you were looking for
Try going back to the main page here
Sorry! We could not find what you were looking for
Try going back to the main page here