1066. Root of AVL Tree (25) PAT甲级

最新推荐文章于 2019-01-22 17:29:00 发布

老虞面馆

最新推荐文章于 2019-01-22 17:29:00 发布

阅读量320

点赞数

分类专栏： PAT 甲级

本文链接：https://blog.csdn.net/SY_Yu/article/details/56876373

版权

PAT 甲级专栏收录该内容

118 篇文章 0 订阅

订阅专栏

传送门
第一次手写AVL。。。。。

#include<stdio.h>
#include<algorithm>

using namespace std;

typedef struct Node{
    int weight;
    int height;
    Node *lchild,*rchild;
}AVLnode,*AVLtree;

AVLtree root;

AVLnode *newNode(int weight){
    AVLnode *node=new AVLnode;
    node->weight=weight;
    node->height=1;
    node->lchild=node->rchild=NULL;
    return node;
}

int getHeight(AVLtree root){
    if(root==NULL)  return 0;
    return root->height;
}

void updateHeight(AVLtree root){
    root->height=max(getHeight(root->lchild),getHeight(root->rchild))+1;
}

int getBalanceFactor(AVLtree root){
    return getHeight(root->lchild)-getHeight(root->rchild);
}

void L(AVLtree &root){
    AVLnode *temp=root->rchild;
    root->rchild=temp->lchild;
    temp->lchild=root;
    updateHeight(root);
    updateHeight(temp);
    root=temp;
}
void R(AVLtree &root){
    AVLnode *temp=root->lchild;
    //root->lchild=temp->lchild;
    root->lchild=temp->rchild;
    temp->rchild=root;
    updateHeight(root);
    updateHeight(temp);
    root=temp;
}

void insert(AVLtree &root,int weight){
    if(root==NULL){
        root=newNode(weight);
        return;
    }
    if(weight<root->weight){
        insert(root->lchild,weight);
        updateHeight(root);
        if(getBalanceFactor(root)==2){
            if(getBalanceFactor(root->lchild)==1){
                R(root);
            }
            else if(getBalanceFactor(root->lchild)==-1){
                L(root->lchild);
                R(root);
            }
        }

    }
    else{
        insert(root->rchild,weight);
        updateHeight(root);
        if(getBalanceFactor(root)==-2){
            if(getBalanceFactor(root->rchild)==-1){
                L(root);
            }
            else if(getBalanceFactor(root->rchild)==1){
                R(root->rchild);
                L(root);
            }
        }
    }
}


int main(){
    int n,weight;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&weight);
        insert(root,weight);
    }
    printf("%d",root->weight);
}