Red/black tree visualisation

See also red/black tree set, that support many types.

What is this?

There is C++ class for red/black tree, that have method for console output for tree without any specific libraries. The program correctly outputs numbers with any number of digits.

What is it for?

This is a training example of a red/black tree. This may be necessary for those who study C++ and dynamic structures such as trees.

Run

make
./main

or

g++ main.cpp rbtree.cpp -o main
./main

Available features

The following methods are available for working with tree:

• void RBTree::insert(const int value): inserts node with value value to a tree and calls the fixup function.
• void RBTree::erase(const int value): erases the node with value value from tree and calls the fixup function.
• int RBTree::max() const: returns maximum value in the tree.
• int RBTree::min() const: returns minimum value in the tree.
• RBTree::Node *find(const int value) const: returns a pointer to a node in the tree with the value value.
• void RBTree::clear(): erases all the nodes from the tree.
• ostream &operator<<(ostream &out, const RBTree &tr): outputs the tree to the ostream. If RBTree::show_null_leaves is true (false by default) it displays null leaves.

Example of output

With null leaves: