CMSC-341, Spring00, Sections 0301
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;
};
]]>
Wednesday, 05-Jan-2000 15:49:45 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