AVL树---二叉平衡树---C++实现

二叉平衡树

核心思想

让同一个root的两个子树的高度之差的绝对值不超过1，因此，我们需要进行“换根”操作，即旋转，旋转又分单旋转和双旋转。

1. 单旋转
即一个root的左右子树高度差为2时，且，子树存在“递减情况”，即左子树的根，存在左儿子，且左儿子也存在左儿子。如下图

核心代码

//左单旋转
NODE SingleRotateWithLeft(NODE tree) {
	NODE temp = tree->lnode;	//原根的左节点作为新的根节点
	tree->lnode = temp->rnode;	//原根的左节点改为其孙子，符合左子树小于根
	temp->rnode = tree;			//原儿子节点的右节点变为原根，符合右子树大于根
	tree->height = height(tree);//修改高度，此代码会在全部代码中展示。
	temp->height = height(temp);
	return temp;
}

同理，右边子树的单旋转也可以实现

//右单旋转
NODE SingleRotateWithRight(NODE tree) {
	NODE temp = tree->rnode;	//原根的右节点作为新的根节点
	tree->rnode = temp->lnode;	//原根的右节点改为其孙子，符合右子树大于根
	temp->lnode = tree;			//原儿子节点的左节点变为原根，符合左子树小于根
	tree->height = height(tree);//修改高度，此代码会在全部代码中展示。
	temp->height = height(temp);
	return temp;
}

2.双旋转
即一个root的左右子树高度差为2时，且，子树存在“非递减情况”，即左子树的根，存在左儿子，且左儿子存在右儿子，这种时候我们需要先通过两次单旋转。如下图，就是一个需要双旋转的情况，我们可以构建先一个右子树单旋转的情况，再使其变成左子树单旋转。

核心代码
左子树情况是先对其左节点进行一次右子树单旋转，再进行对根的左子树单旋转。直接调用前面的单旋转函数就ok。

NODE DoubleRotateWithLeft(NODE tree) {
	tree->lnode = SingleRotateWithRight(tree->lnode);
	return SingleRotateWithLeft(tree);
}

右子树则相反

NODE DoubleRotateWithRight(NODE tree) {
	tree->rnode = SingleRotateWithLeft(tree->rnode);
	return SingleRotateWithRight(tree);
}

全部代码

#include<iostream>
#include<algorithm>
using namespace std;

typedef struct Node {
	int data, height;
	struct Node* lnode;
	struct Node* rnode;
}Node,*NODE;

NODE createNode(int data) {
	NODE node = (NODE)malloc(sizeof(Node));
	node->height = 0;
	node->data = data;
	node->lnode = node->rnode = NULL;
	return node;
}

int height(NODE node) {
	if (node == NULL) return -1;
	else return max(height(node->lnode),height(node->rnode)) + 1;
}

NODE SingleRotateWithLeft(NODE tree) {
	NODE temp = tree->lnode;
	tree->lnode = temp->rnode;
	temp->rnode = tree;
	tree->height = height(tree);
	temp->height = height(temp);
	return temp;
}

NODE SingleRotateWithRight(NODE tree);	//声明

NODE DoubleRotateWithLeft(NODE tree) {
	tree->lnode = SingleRotateWithRight(tree->lnode);
	return SingleRotateWithLeft(tree);
}

NODE SingleRotateWithRight(NODE tree) {
	NODE temp = tree->rnode;
	tree->rnode = temp->lnode;
	temp->lnode = tree;
	tree->height = height(tree);
	temp->height = height(temp);
	return temp;
}

NODE DoubleRotateWithRight(NODE tree) {
	tree->rnode = SingleRotateWithLeft(tree->rnode);
	return SingleRotateWithRight(tree);
}


NODE Insert(int data, NODE &tree) {
	if (tree == NULL) {
		tree = createNode(data);
	}
	else if (data < tree->data) {
		tree->lnode = Insert(data, tree->lnode);
		if (!tree->rnode && height(tree->lnode) >= 2 || tree->rnode && height(tree->lnode)- height(tree->rnode) == 2) {
			if (data < tree->lnode->data) tree = SingleRotateWithLeft(tree);
			else tree = DoubleRotateWithLeft(tree);
		}
	}
	else if (data > tree->data) {
		tree->rnode = Insert(data, tree->rnode);
		if (!tree->lnode && height(tree->rnode) >= 2 || tree->lnode && height(tree->rnode) - height(tree->lnode) == 2) {
			if (data > tree->rnode->data) tree = SingleRotateWithRight(tree);
			else tree = DoubleRotateWithRight(tree);
		}
	}
	return tree;
}

void PreOrder(NODE root) {
	if (root) {
		cout << root->data;
		PreOrder(root->lnode);
		PreOrder(root->rnode);
	}
}

void InOrder(NODE root) {
	if (root) {
		InOrder(root->lnode);
		cout << root->data;
		InOrder(root->rnode);
	}
}

void PostOrder(NODE root) {
	if (root) {
		PostOrder(root->lnode);
		PostOrder(root->rnode);
		cout << root->data;
	}
}

void Print(NODE tree) {
	cout << "先序：";
	PreOrder(tree);
	cout << endl;
	cout << "中序：";
	InOrder(tree);
	cout << endl;
	cout << "后序：";
	PostOrder(tree);
	cout << endl;
}

int main() {
	int n, data;
	NODE tree = NULL;
	cout << "输入要插入的节点数:";
	cin >> n;
	cout << "开始输入节点" << endl;
	for (int i = 0; i < n; i++) {
		cin >> data;
		tree = Insert(data, tree);
	}
	cout << tree->data << endl;
	Print(tree);
	return 0;
}

实现效果