Implementation of Red Black Tree in C++ (rbt.cpp and rbt.h)

Implement the following methods with the same name and same parameter data types. You are free to add any helper function or method.

Implement a Red Black Tree (with integer nodes), closely following the specifications and algo- rithms from the lecture. Write your code either in C++ accepted. Save your solution to Make sure you handle errors appropriately Grading will be based on case-tests, therefore make sure that you use the exact naming of func- tions and classes below. We will test all functions, classes, structs that are listed below. Feel free to define any number of helper functions. - no other languages will be and rbt.cpp (header in rbt.h) for C++ enum Color RED, BLACK struct Node int data Color colori Node left, *right, parent; class RedBlackTree private Node root void rotateLeft (Node s) void rotateRight(Node ); public RedBlackTree ( void insert (int) void delete (Node& Node- predecessor (Node& Node* successor (Node*s) Node+ getMinimum Node* getMaximum Node, search(int)