fig12_29.cpp

来自「经典书籍源代码啊。。。第三版。。。数据结构与算法分析——C++描述(第3版).」· C++ 代码 · 共 23 行

    /**
     * Skew primitive for AA-trees.
     * t is the node that roots the tree.
     */
    void skew( AANode * & t )
    {
        if( t->left->level == t->level )
            rotateWithLeftChild( t );
    }
    
    /**
     * Split primitive for AA-trees.
     * t is the node that roots the tree.
     */
    void split( AANode * & t )
    {
        if( t->right->right->level == t->level )
        {
            rotateWithRightChild( t );
            t->level++;
        }
    }