1066 Root of AVL Tree（25分）_1066 root of avl tree柳-CSDN博客

本文链接：https://blog.csdn.net/qq_46625424/article/details/124581089

该博客讨论了AVL树的自我平衡性质，详细解释了左旋、右旋、左右旋和右左旋四种旋转规则，以及如何在插入过程中保持平衡。通过给出的代码示例，展示了如何实现AVL树的插入操作并维持平衡状态，最终找到并打印出AVL树的根节点。

摘要由CSDN通过智能技术生成

题目：An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules.
Now given a sequence of insertions, you are supposed to tell the root of the resulting AVL tree.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (≤20) which is the total number of keys to be inserted. Then N distinct integer keys are given in the next line. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print the root of the resulting AVL tree in one line.

题型分类：AVL树构建；
题目大意：打印AVL树的根节点。
解题思路：AVL调整BST的四种情况【左旋、右旋、左右旋、右左旋】，在对AVL树进行递归找到应插入位置并插入结点的同时，向上回溯判断树是否平衡。

代码如下：

#include<bits/stdc++.h>
using namespace std;
struct node{
    int val;
    node *left, *right;
    node(int v):val(v){
        left = nullptr;
        right = nullptr;
    }
};
int getHeight(node *root){
    if(root == nullptr)
        return 0;
    return max(getHeight(root->left),getHeight(root->right)) + 1;
}
node *rotateLeft(node *root){
    node *t = root->right;
    root->right = t->left;
    t->left = root;
    return t;
}
node *rotateRight(node *root){
    node *t = root->left;
    root->left = t->right;
    t->right = root;
    return t;
}
node *rotateLeftRight(node *root){
    root->left = rotateLeft(root->left);
    return rotateRight(root);
}
node *rotateRightLeft(node *root){
    root->right = rotateRight(root->right);
    return rotateLeft(root);
}
node *insert(node *root, int val){
    if(root == nullptr)
        root = new node(val);
    else if(val < root->val){
        root->left = insert(root->left,val);
        if(getHeight(root->left) - getHeight(root->right) == 2)
            root = val < root->left->val ? rotateRight(root) : rotateLeftRight(root);
    }
    else{
        root->right = insert(root->right,val);
        if(getHeight(root->right) - getHeight(root->left) == 2)
            root = val > root->right->val ? rotateLeft(root) : rotateRightLeft(root);
    }
    return root;
}
int main(){
    int N, val;
    cin>>N;
    node *root = nullptr;
    for(int i = 0; i < N; i++){
        cin>>val;
        root = insert(root,val);
    }
    cout<<root->val;
    return 0;
}