#define Ty int  //以整型數據為例
typedef struct Node
{
	Ty data;             //數據
	int height;          //高度
	struct Node* LChild; //左子樹
	struct Node* RChild; //右子樹
}Node,AVLTree;

AVLTree* creatAVLTree(Ty data)
{
    AVLTree* tree = (AVLTree*)malloc(sizeof(AVLTree));
    assert(tree);
    tree->data = data;
    tree->height = 0;
    tree->LChild = NULL;
    tree->RChild = NULL;
    return tree;
}

//輔助函數
#define HEIGHT(x) ((x==NULL)?(-1):(x->height))
#define MAX(a,b)  ((a>b)?(a):(b))
//獲取樹的新高度
#define GET_NEW_HEIGHT(x) (MAX(HEIGHT(x->LChild),HEIGHT(x->RChild)) + 1)

//前序打印
void show_pre(AVLTree* root)
{
	if(root==NULL)
		return;
	printf("data:%d\theight:%d\n",root->data,root->height);
	show_pre(root->LChild);
	show_pre(root->RChild);
}

//出現(xiàn)不平衡的情況
//左左不平衡
Node *LL_Rotation(Node *curRoot)
{
	Node *newRoot = curRoot->LChild;
	curRoot->LChild = newRoot->RChild;
	newRoot->RChild = curRoot;

	curRoot->height = GET_NEW_HEIGHT(curRoot);
	newRoot->height = GET_NEW_HEIGHT(newRoot);
	return newRoot;
}

//右右不平衡
Node *RR_Rotation(Node *curRoot)
{
	Node *newRoot = curRoot->RChild;
	curRoot->RChild = newRoot->LChild;
	newRoot->LChild = curRoot;

	curRoot->height = GET_NEW_HEIGHT(curRoot);
	newRoot->height = GET_NEW_HEIGHT(newRoot);
	return newRoot;
}
//左右不平衡
Node *LR_Rotation(Node *curRoot)
{
	curRoot->LChild = RR_Rotation(curRoot->LChild);
	return LL_Rotation(curRoot);
}
//右左不平衡
Node *RL_Rotation(Node *curRoot)
{
	curRoot->RChild = LL_Rotation(curRoot->RChild);
	return RR_Rotation(curRoot);
}

//插入數據
Node *insertNode(Node *curRoot, Ty data)
{
	//插入分有四個大情況
	if (curRoot == NULL)			  //當前節(jié)點是空的
		curRoot = creatAVLTree(data); //如果是空就直接創(chuàng)建一個新的節(jié)點
	else if (data < curRoot->data)	  //要插入的數據比當前節(jié)點的數據小
	{
		//往左邊跑
		curRoot->LChild = insertNode(curRoot->LChild, data);
		//插入完成之后，判斷需不需要調整樹
		if (HEIGHT(curRoot->LChild) - HEIGHT(curRoot->RChild) == 2)
			//因為插入的位置在左邊，所以插入完成之后，左子樹的高度大于等于右子樹高度
			curRoot = data < curRoot->LChild->data ? LL_Rotation(curRoot) : LR_Rotation(curRoot);
	}
	else if (data > curRoot->data) //要插入的數據比當前節(jié)點的數據大
	{
		//往右邊跑
		curRoot->RChild = insertNode(curRoot->RChild, data);
		if (HEIGHT(curRoot->RChild) - HEIGHT(curRoot->LChild) == 2)
			//因為插入的位置在右邊，所以插入完成之后，右子樹的高度大于等于左子樹高度
			curRoot = data > curRoot->RChild->data ? RR_Rotation(curRoot) : RL_Rotation(curRoot);
	}
	else //要插入的數據和當前節(jié)點的數據一樣大
		printf("無法插入數據\n");
	//獲取新高度
	curRoot->height = GET_NEW_HEIGHT(curRoot);
	return curRoot; //插入完成之后返回當前節(jié)點的指針
}

//查找節(jié)點
//找最大節(jié)點
Node *maxNode(Node *curRoot)
{
	if (curRoot == NULL)
		return NULL;
	//往右邊找
	while (curRoot->RChild)
		curRoot = curRoot->RChild;
	return curRoot;
}

//找最小節(jié)點
Node *minNode(Node *curRoot)
{
	if (curRoot == NULL)
		return NULL;
	while (curRoot->LChild)
		curRoot = curRoot->LChild;
	return curRoot;
}

//刪除數據
Node *deleteNode(Node *curRoot, Ty data)
{
	//刪除數據有四個大情況
	if (curRoot == NULL)	  //當前節(jié)點是空的
		return NULL;		  //刪除了個寂寞直接結束掉整個函數
	if (data < curRoot->data) //要刪除的數據比當前節(jié)點的數據小
	{
		//往左邊跑
		curRoot->LChild = deleteNode(curRoot->LChild, data);
		//獲取新高度
		curRoot->height = GET_NEW_HEIGHT(curRoot);
		//判斷需不需要調整
		if (HEIGHT(curRoot->RChild) - HEIGHT(curRoot->LChild) == 2)
			curRoot = HEIGHT(curRoot->RChild->LChild) > HEIGHT(curRoot->RChild->RChild) ? RL_Rotation(curRoot) : RR_Rotation(curRoot);
	}
	else if (data > curRoot->data) //要刪除的數據比當前節(jié)點的數據大
	{
		//往右邊跑
		curRoot->RChild = deleteNode(curRoot->RChild, data);
		curRoot->height = GET_NEW_HEIGHT(curRoot);
		if (HEIGHT(curRoot->LChild) - HEIGHT(curRoot->RChild) == 2)
			curRoot = HEIGHT(curRoot->LChild->RChild) > HEIGHT(curRoot->LChild->LChild) ? LR_Rotation(curRoot) : LL_Rotation(curRoot);
	}
	else
	{ //要刪除的數據和當前節(jié)點的數據一樣大
		//針對于curRoot這個節(jié)點做刪除操作
		//主要有兩個主要的情況
		if (curRoot->LChild && curRoot->RChild) // curRoot有左子樹和右子樹
		{
			//先判斷左右子樹的高度，將高度比較高的子樹的節(jié)點拿到上面來
			if (HEIGHT(curRoot->LChild) > HEIGHT(curRoot->RChild))
			{ //左子樹的高度比右子樹的高度高
				//找到左子樹的最大節(jié)點
				Node *max = maxNode(curRoot->LChild);
				//找到之后就將max的數據替換curRoot的數據
				curRoot->data = max->data;
				//賦值完成之后繼續(xù)遞歸，然后釋放掉max對應的節(jié)點，不能直接在這里釋放，因為要調整樹的高度
				curRoot->LChild = deleteNode(curRoot->LChild, max->data);
			}
			else
			{ //左子樹的高度小于等于右子樹的高度
				//找到右子樹的最小節(jié)點
				Node *min = minNode(curRoot->RChild);
				curRoot->data = min->data;
				curRoot->RChild = deleteNode(curRoot->RChild, min->data);
			}
		}
		else //上一種情況的否定，即curRoot沒有子樹或者只有一邊
		{
			//釋放內存
			Node *temp = curRoot;
			// curRoot拿到存在的子樹
			curRoot = curRoot->LChild ? curRoot->LChild : curRoot->RChild;
			free(temp);
		}
	}

	return curRoot; //刪除完成之后就返回當前節(jié)點
}

int main()
{
	AVLTree *tree = NULL;
	for (int i = 1; i < 10; i++)
		tree = insertNode(tree, i);
	show_pre(tree); //前序打印樹
	printf("----------------------------\n");
	//刪除6這個節(jié)點
	tree = deleteNode(tree, 6);
	show_pre(tree);
	printf("程序結束\n");
	return 0;
}