CMSC-341, Fall 1999, Sections 0101
BST.H (2 of 2)
<![CDATA[
private:
BinaryNode *root;
const Comparable ITEM_NOT_FOUND;
const Comparable elementAt (BinaryNode<Comparable> *t) const;
void
insert (const Comparable & x, BinaryNode<Comparable> * & t) const;
void
remove (const Comparable & x, BinaryNode<Comparable> * & t) const;
BinaryNode<Comparable> *findMin (BinaryNode<Comparable> *t) const;
BinaryNode<Comparable> *findMax (BinaryNode<Comparable> *t) const;
BinaryNode<Comparable> *find (BinaryNode<Comparable> *t) const;
void makeEmpty (BinaryNode<Comparable> * & t);
void printTree (BinaryNode<Comparable> * t) const;
BinaryNode<Comparable> * clone (BinaryNode<Comparable> * t) const;
};
]]>
Dennis Frey
Last modified: Sun Sep 26 23:22:08 EDT 1999