递归实现Avl树的删除、建立（C++）

通过递归实现Avl树的删除和建立(c++)，如有不足之处望指出。

其中avl树的建立参考了《数据结构与算法分析》（C语言实现）。

现附上头文件和删除部分：

#ifdef AvlNode
#define AviNode
struct AvlNode;
typedef AvlNode *Position;
typedef AvlNode *AvlTree;
typedef int ElementType;
AvlTree MakeEmpty(AvlTree T);
Position Find(ElementType X, AvlTree T);
Position FindMin(AvlTree T);
Position FindMax(AvlTree T);
AvlTree Insert(ElementType X, AvlTree T);
AvlTree Delete(ElementType X, AvlTree T);
ElementType Retrive(Position P);
#endif
//implementation
struct AvlNode // 树节点
{
    ElementType Element;
    AvlTree Left;
    AvlTree Right;
    int Height;
};

删除例程：

AvlTree Delete(ElementType X, AvlTree T) //删除节点
{
    Position Temp;
    if (T == nullptr) {
        return 0;
    }
    else if(X < T->Element) // x 位于左子树
    {
        T->Left = Delete(X, T->Left);
        T->Height = Max(Height(T->Left),Height(T->Right)) + 1; // 重置T->Height
//****这里隐藏了一步判断：if(Height(T->Right) - Height(T->Left) > 1) 但是因为删除的节点位于左子树 所以右子树的高一定大大左子树（下同）****//
        if(Height(T->Right->Right) >= Height(T->Right->Left))
            T = SingleRotateWithRight(T);
        else
            T = DoubleRotateWithRight(T);
    }
    else if(X > T->Element) // x 位于右子树
    {
        T->Right = Delete(X, T->Right);
        T->Height = Max(Height(T->Left),Height(T->Right)) + 1;
        if(Height(T->Left) - Height(T->Right) > 1){
            if(Height(T->Left->Left) >= Height(T->Left->Right))
                T = SingleRotateWithLeft(T);
            else
                T = DoubleRotateWithLeft(T);
        }
    }
    else if(T->Left && T->Right)
    {
        Temp = FindMin(T->Right);
        T->Element = Temp->Element;
        T->Right = Delete(T->Element, T->Right);
    }
    else
    {
        Temp = T;
        if (T->Right == nullptr) {
            T = T->Left;
        
        }
        else if(T->Left == nullptr){
            T = T->Right;
        }
        delete T;
    }
    return T;
}

全部程序：

#include <iostream>
// #ifdef AvlNode
// #define AviNode
struct AvlNode;
typedef AvlNode *Position;
typedef AvlNode *AvlTree;
typedef int ElementType;
AvlTree MakeEmpty(AvlTree T);
Position Find(ElementType X, AvlTree T);
Position FindMin(AvlTree T);
Position FindMax(AvlTree T);
AvlTree Insert(ElementType X, AvlTree T);
AvlTree Delete(ElementType X, AvlTree T);
ElementType Retrive(Position P);
// #endif
// implementation
struct AvlNode // 树节点
{
    ElementType Element;
    AvlTree Left;
    AvlTree Right;
    int Height;
};
AvlTree MakeEmpty(AvlTree T) //置空
{
    if (T != nullptr) {
        MakeEmpty(T->Left);
        MakeEmpty(T->Right);
        delete T;
    }
    return nullptr;
}
Position Find(ElementType X, AvlTree T) //查找
{
    if (T == nullptr) {
        return nullptr;
    }
    else if(X < T->Element){
        return Find(X, T->Left);
    }
    else if(X > T->Element){
        return Find(X, T->Right);
    }
    else return T;
}
Position FindMin(AvlTree T) // 最小值
{
    if (T != nullptr) {
        while (T->Left != nullptr) {
            T = T->Left;
        }
    }
    return T;
}
Position FindMax(AvlTree T) // 最大值
{
    if (T == nullptr) {
        return nullptr;
    }
    else if(T->Right == nullptr){
        return T;
    }
    else return FindMax(T->Right);
}
static int Height(Position P) // 节点高
{
    if (P == nullptr) {
        return -1;
    }
    else
        return P->Height;
}
int Max(int a, int b)
{
    return a > b ? a : b;
}
static Position SingleRotateWithLeft(Position K2) // 左单旋转
{
    Position K1 = K2->Left;
    K2->Left = K1->Right;
    K1->Right = K2;
    K2->Height = Max(Height(K2->Left),Height(K2->Right))+1;
    K1->Height = Max(Height(K1->Left), K2->Height)+1;
    return K1;
}
static Position SingleRotateWithRight(Position K2) // 右单旋转
{
    Position K1 = K2->Right;
    K2->Right = K1->Left;
    K1->Left = K2;
    K2->Height = Max(Height(K2->Left),Height(K2->Right))+1;
    K1->Height = Max(Height(K1->Left), K2->Height)+1;
    return K1;
}
static Position DoubleRotateWithLeft(Position K3) //左双旋转
{
    K3->Left = SingleRotateWithRight(K3->Left);
    return SingleRotateWithLeft(K3->Left);
}
static Position DoubleRotateWithRight(Position K3) //右双旋转
{
    K3->Right = SingleRotateWithLeft(K3->Right);
    return SingleRotateWithRight(K3->Right);
}
AvlTree Insert(ElementType X, AvlTree T) //插入
{
    if(T == nullptr)
    {
        T = new AvlNode;
        T->Element = X;
        T->Right = nullptr;
        T->Left = nullptr;
        T->Height = 0;
    }
    else if(X < T->Element)
    {
        T->Left = Insert(X, T->Left);
        if (Height(T->Left) - Height(T->Right) == 2) {
            if(X < T->Left->Element)
                T = SingleRotateWithLeft(T);
            else
                T = DoubleRotateWithLeft(T);
        }
    }
    else if(X > T->Element)
    {
        T->Right = Insert(X, T->Right);
        if (Height(T->Right) - Height(T->Left) == 2) {
            if (X > T->Right->Element)
                T = SingleRotateWithRight(T);
            else
                T = DoubleRotateWithRight(T);
        }
    }
    T->Height = Max(Height(T->Left), Height(T->Right))+1;
    return T;
}
AvlTree Delete(ElementType X, AvlTree T) //删除节点
{
    Position Temp;
    if (T == nullptr) {
        return 0;
    }
    else if(X < T->Element) // x 位于左子树
    {
        T->Left = Delete(X, T->Left);
        T->Height = Max(Height(T->Left),Height(T->Right)) + 1; // 重置T->Height
//这里隐藏了一步判断：if(Height(T->Right) - Height(T->Left) > 1) 但是因为删除的节点位于左子树 所以右子树的高一定大大左子树//
        if(Height(T->Right->Right) >= Height(T->Right->Left))
            T = SingleRotateWithRight(T);
        else
            T = DoubleRotateWithRight(T);
    }
    else if(X > T->Element) // x 位于右子树
    {
        T->Right = Delete(X, T->Right);
        T->Height = Max(Height(T->Left),Height(T->Right)) + 1;
        if(Height(T->Left) - Height(T->Right) > 1){
            if(Height(T->Left->Left) >= Height(T->Left->Right))
                T = SingleRotateWithLeft(T);
            else
                T = DoubleRotateWithLeft(T);
        }
    }
    else if(T->Left && T->Right)
    {
        Temp = FindMin(T->Right);
        T->Element = Temp->Element;
        T->Right = Delete(T->Element, T->Right);
    }
    else
    {
        Temp = T;
        if (T->Right == nullptr) {
            T = T->Left;
        
        }
        else if(T->Left == nullptr){
            T = T->Right;
        }
        delete T;
    }
    return T;
}
void PrintElement(ElementType X)
{
    std::cout<<X<<" ";
}
void PrintTree(AvlTree T)
{
    if (T != nullptr) {
        PrintTree(T->Left);
        PrintElement(T->Element);
        PrintTree(T->Right);
    }
}
//main
int main(int argc, const char * argv[]) {
    
    using namespace std;
    AvlTree T;
    srand((unsigned)time(0));
    
    for (int i = 1; i < 6; i++) {
        T = Insert(i, T);
    }
    PrintTree(T);
    T = Delete(4, T);
    cout<<" ";
    PrintTree(T);
}