平衡二叉树(AVL)的完整实现

#include "stdafx.h"
#include <iostream>

#define LH 1
#define EH 0
#define RH -1

using namespace std;
typedef struct BiTNode {
	int data;
	int bf;     //平衡因子
	BiTNode *lchild, *rchild;
}BiTNode,*BiTree;

void R_Rotate(BiTree *T) {      //右旋
	BiTree p;
	p = (*T)->lchild;
	(*T)->lchild = p->rchild;
	p->rchild = (*T);
	(*T) = p;
}

void L_Rotate(BiTree *T) {     //左旋
	BiTree p;
	p = (*T)->rchild;
	(*T)->rchild = p->lchild;
	p->lchild = (*T);
	(*T) = p;
}

void LeftBalance(BiTree *T) {    //左平衡
	BiTree L, Lr;
	L = (*T)->lchild;
	switch (L->bf)
	{
	case LH:
		(*T)->bf = EH;
		L->bf = EH;
		R_Rotate(T);
		break;
	case RH:
		Lr = L->rchild;
		switch (Lr->bf)
		{
		case LH:
			L->bf = EH;
			(*T)->bf = RH;
			break;
		case EH:
			L->bf = EH;
			(*T)->bf = EH;
			break;
		case RH:
			L->bf = LH;
			(*T)->bf = EH;
			break;
		}
		L_Rotate(&(*T)->lchild);
		R_Rotate(T);
	}
}

void RightBalance(BiTree *T) {    //右平衡
	BiTree L, Lr;
	L = (*T)->rchild;
	switch (L->bf)
	{
	case RH:
		(*T)->bf = L->bf = EH;
		L_Rotate(T);
		break;
	case LH:
		Lr = L->lchild;
		switch (Lr->bf)
		{
		case RH:
			L->bf = EH;
			(*T)->bf = LH;
			break;
		case EH:
			L->bf = (*T)->bf = EH;
			break;
		case LH:
			L->bf = RH;
			(*T)->bf = EH;
			break;
		}
		R_Rotate(&(*T)->rchild);
		L_Rotate(T);
	}
}


bool InsertAVL(BiTree *T, int e, int *taller) {   //此处的taller是判断这个结点是否长高
	if (!*T) {
		(*T) = new BiTNode;
		(*T)->data = e;
		(*T)->lchild = (*T)->rchild = NULL;
		(*T)->bf = EH;
		*taller = true;  //刚开始默认长高  后来在做实际判断
		return true;
	}
	else
	{
		if (e ==(*T)->data) {
			*taller = false;
			return false;
		}
		else if (e < (*T)->data) {
			if (!InsertAVL(&((*T)->lchild), e, taller) ){    //先判断要插入的这个结点是否在树中
				return false;
			}
			if (*taller) {
				switch ((*T)->bf)
				{
				case LH:
					LeftBalance(T);
					*taller = false;
					break;
				case EH:
					(*T)->bf = LH;
					*taller = true;
					break;
				case RH:
					(*T)->bf = EH;
					*taller = false;
					break;
				}
			}
		}
		else  
		{
			if (!InsertAVL(&((*T)->rchild), e, taller)){  
				return false;
			}
			if (*taller) {
				switch ((*T)->bf)
				{
				case RH:
					RightBalance(T);
					*taller = false;
					break;
				case EH:
					(*T)->bf = RH;
					*taller = true;
					break;
				case LH:
					*taller = false;
					(*T)->bf = EH;
					break;
				}
			}
		}
	}
}

void CreateAVL(BiTree *T) {
	int x;
	cout << "请输入数据(输入0表示结束)    ";
	cin >> x;
	int taller;
	while (x != 0) {
		InsertAVL(T, x,&taller);
		cin >> x;
	}
}

int main(){

    BiTree T=NULL;
    CreatAVL(&T)；
    return 0;

}