Method get

templates/red-black-tree.cpp:146–151

    }

    int get(int key)
    {
        // 普通的搜索
        auto v = getInternal(root, key);
        return v ? v->v : -1;
    }

    void insert(RBTreeNode* z)
    {