Ch1_AVLtree

约 22 个字 7 行代码

C++

AVLtree right_rotation(AVLtree head)
{
    AVLtree y=head->left->right,ans=head->left;
    head->left->right=head;
    head->left=y;
    return ans;
}

What will happen when the BF of B is -1 in the first tree.

尝试实现四种旋转