平衡二叉树-的四种旋转调整(代码,图解)
1.右单旋:
新插入节点插入在较高左子树的左侧(左左右),插入新节点二十:
1.修改parent和curLR的孩子指针域
parent->left = curLR;
if (subLR)
curLR->parent = parent;
2.修改parent和curL的指针域
curL->right = parent;
3.处理旋转之前parent的双亲的孩子
Node* pparent = parent->parent;
parent->parent = curL;
curL->parent = pparent;
if (nullptr == pparent)
{
_root = subL;
}
else
{
if (parent == pparent->left)
pparent->left = curL;
else
pparent->right = curL;
}
2.左单旋
新插入节点插入在较高右子树的右侧(右右左),插入新节点60
同理右单旋:
void RotateLeft(Node* parent)
{
Node* subR = parent->right;
Node* subRL = subR->left;
parent->right = subRL;
if (subRL)
subRL->parent = parent;
subR->left = parent;
Node* pparent = parent->parent;
parent->parent = subR;
subR->parent = pparent;
if (nullptr == pparent)
{
_root = subR;
}
else
{
if (parent == pparent->left)
pparent->left = subR;
else
pparent->right = subR;
}
}
3.左右双旋
新插入节点插入在较高左子树的右侧,先左旋调整为需要右旋的情况,再右旋
void RotateLR(Node* parent)
{
RotateLeft(parent->left);
RotateRight(parent);
}
4.右左双旋
新插入节点插入在较高右子树的左侧,先右旋调整为需要左旋的情况,再左旋
void RotateRL(Node* parent)
{
RotateRight(parent->right);
RotateLeft(parent);
}
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)