class BalancedTree

Red-black tree for symbol table objects.

Public Methods

BalancedTree()

Default constructor

~BalancedTree()

Destructor

statusEnum insertItem(keyType* , recType* )

SymbolTable-friendly wrapper for insertNode()

statusEnum deleteItem(keyType* )

SymbolTable-friendly wrapper for deleteNode()

statusEnum findSymbol(const keyType* , recType* &)

Given a key, find the symbol

nodeType* treeMinimum(nodeType* )

Find minimum in subtree, used by fixup routines

nodeType* treeSuccessor(nodeType* )

Find successor in subtree, used by fixup routines

nodeType* treeMaximum(nodeType* )

Find maximum in subtree, used by fixup routines

nodeType* search(const keyType* , nodeType* = 0)

Basic recursive search routine

int isRoot(nodeType* n)

Is this the root node?

int isNil(nodeType* n)

is this the nil node?

ostream& dumpNode(ostream &, char* , nodeType* = 0)

Routine for recursive dump of nodes

Documentation

Red-black tree for symbol table objects. Algorithm shamelessly grabbed from our betters -- namely Cormen, et al.

BalancedTree()

Default constructor

~BalancedTree()

Destructor

statusEnum insertItem(keyType* , recType* )

SymbolTable-friendly wrapper for insertNode()

statusEnum deleteItem(keyType* )

SymbolTable-friendly wrapper for deleteNode()

statusEnum findSymbol(const keyType* , recType* &)

Given a key, find the symbol

nodeType* treeMinimum(nodeType* )

Find minimum in subtree, used by fixup routines

nodeType* treeSuccessor(nodeType* )

Find successor in subtree, used by fixup routines

nodeType* treeMaximum(nodeType* )

Find maximum in subtree, used by fixup routines

nodeType* search(const keyType* , nodeType* = 0)

Basic recursive search routine

int isRoot(nodeType* n)

Is this the root node?

int isNil(nodeType* n)

is this the nil node?

ostream& dumpNode(ostream &, char* , nodeType* = 0)

Routine for recursive dump of nodes

This class has no child classes.

Friends:

ostream &operator<<(ostream &, BalancedTree &)

Alphabetic index HTML hierarchy of classes or Java