AVL树的四种旋转

最新推荐文章于 2024-03-31 13:52:30 发布

DaDou001

最新推荐文章于 2024-03-31 13:52:30 发布

阅读量265

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/qq_44905386/article/details/104946121

版权

C++ 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

文章目录

- - - 左单旋
    - 右单旋

左单旋

void leftRorate(pNode parent){
		pNode grandParent = parent->_parent;
		pNode parentRight = parent->_right;
		pNode rightLeft = parentRight->_left;

		parentRight->_left = parent;
		parent->_parent = parentRight;

		parent->_right = rightLeft;
		if (rightLeft){
			rightLeft->_parent = parent;
		}

		parentRight->_parent = grandParent;
		if (parent != _root){
			if (grandParent->_left == parent){
				grandParent->_left = parentRight;
			}
			else{
				grandParent->_right = parentRight;
			}
		}
		else{
			_root = parentRight;
		}

		parentRight->_fd = parent->_fd = 0;
	}

右单旋

void rightRorate(pNode parent){

		pNode grandParent = parent->_parent;
		pNode parentLeft = parent->_left;
		pNode leftRight = parentLeft->_right;

		//6个连接
		parentLeft->_right = parent;
		parent->_parent = parentLeft;

		parent->_left = leftRight;
		if (leftRight){
			leftRight->_parent = parent;
		}

		parentLeft->_parent = grandParent;
		if (parent != _root){
			if (grandParent->_left == parent){
				grandParent->_left = parentLeft;
			}
			else{
				grandParent->_right = parentLeft;
			}
		}
		else{
			_root = parentLeft;
		}

		//更新平衡因子
		parent->_fd = parentLeft->_fd = 0;	
	}