Tools.h++ Class Reference

Copy constructor. Constructs a shallow copy from t. Member function balance() (see
below) is called before returning.
virtual ~RWBinaryTree();
Redefined from RWCollection. Calls clear().
Public Member Operators
void
operator=(const RWBinaryTree& bt);
Sets self to a shallow copy of bt.
void
operator+=(const RWCollection ct);
Inserts each element of .ct into self. Note that using this operator to insert an
already-sorted collection will result in creating a very unbalanced tree, possibly to the
point of stack overflow.
RWBoolean
operator<=(const RWBinaryTree& bt) const;
Returns TRUE if self is a subset of the collection bt. That is, every item in self must
compare equal to a unique item in bt.
RWBoolean
operator==(const RWBinaryTree& bt) const;
Returns TRUE if self and bt are equivalent. That is, they must have the same number of
items and every item in self must compare equal to a unique item in bt.
Public Member Functions
virtual void
apply(RWapplyCollectable ap, void*);
Redefined from class RWCollection to apply the user-supplied function pointed to by ap
to each member of the collection, in order, from smallest to largest. This supplied
function should not do anything to the items that could change the ordering of the
collection.
void
balance();
Special function to balance the tree. In a perfectly balanced binary tree with no duplicate
elements, the number of nodes from the root to any external (leaf) node differs by at most
one node. Since this collection allows duplicate elements, a perfectly balanced tree is not
always possible. Preserves the order of duplicate elements.