BST

A simple templated binary search tree implementation

Supported operations

• BST::insert : insert a value (or a lot if you specify a std::vector)
• BST::remove : remove a value
• BST::contains : check for a value existence
• BST::minVal | BST::maxVal : check for actual lower|upper bounds
• BST::closestValue : Get the closest value from the one you specify
• BST::isValid : check if your BST is valid (should always be the case unless you mess with it...)
• Traversal methods : preOrder | inOrder | postOrder | levelOrder

And...that's it !