Class RBTreeNode

templates/rb.cpp:24–96

public:
    struct RBTreeNode {
        int k = 0;
        int v = 0;
        RBTreeNode* p = nullptr;
        RBTreeNode* left = nullptr;
        RBTreeNode* right = nullptr;
        Color color = RED;

        RBTreeNode(int k, int v, Color color)
            : k(k)
            , v(v)
            , color(color)
        {
            left = NIL;
            right = NIL;
            p = NIL;
        }

        void setLeft(RBTreeNode* n)
        {
            if (n == nullptr) {
                printf("wrong left\n");
            }
            this->left = n;
        }

        void setRight(RBTreeNode* n)
        {
            if (n == nullptr) {
                printf("wrong left\n");
            }
            right = n;
        }

        bool isLeft()
        {
            return this == p->left;
        }

        bool isRight()
        {
            return this == p->right;
        }

        RBTreeNode* brother()
        {
            return isLeft() ? p->right : p->left;
        }

        void replaceChild(RBTreeNode* n, RBTreeNode* new_node)
        {
            if (n == left) {
                left = new_node;
            } else {
                right = new_node;
            }
            new_node->p = this;
        }