waydrow / rbtree

RBTree's c++ implemention

RBTree

RBTree's c++ implemention

Guide

Initial

RBTree<int> *tree = new RBTree<int>();

Insert

// The type of x equal to Initial type
tree->insert(x);

Find

// x is the key that you want to find
// it will return the point of the node (key is x) if x exist
Node<int>* p = tree->find(x);

Print

// it will show info of the current rb tree
tree->print();

Delete

// it will delete the node that has value of x in the tree
tree->erase(x);

Clear

// it will delete all nodes of the tree
tree->clear();

Release Space

delete tree;