说明：  实现红黑树、二叉搜索树相关算法：插入（红黑树涉及树的调整：左旋、右旋等），删除，搜索（指定Key值节点）。 另外，红黑树实现计算树黑高的算法。
(To achieve red-black tree, binary search tree related algorithms: insertion (red-black tree involves the adjustment of the tree: L, D, etc.), delete, search (Key value of the specified node). In addition, the red-black tree implementation of the algorithm for computing the high black tree.)