// main.cpp // Please insert your code snippet according to the comments 

#include using namespace std; // RBT node struct; a node contais 3 pointers, which point to the parenet, // left and right sub-tree, respectively. If the node were the root, its parent is set to be NULL struct node int key; char color; node "parent; node left; node right; // RBT class class RBtree node root; public: RBtree() root NULL; // I understand that I need to implement a destructor to release the newed memories, / but I'm too lazy to do so; it does not affect your implementation of insertion anyway, luckily void insert(int x); // RBT insertiong node BSTinsert(int); you need to implement this (10 pts.) void disp); /I RBT display