Red Black Tree c++ implementation

Templated Red Black Tree implementation in c++

Data structure specs: Provides search, insert, and deletion methods that perform in guarenteed worst case O(log(n)). Space in average and worst case scenarios is O(n).