参考连接:https://blog.csdn.net/isunbin/article/details/81707606
#include <iostream>
using namespace std;
struct node {
int val;
struct node *left, *right;
};
node *rr_rotate(node *root) {
node *t = root->right;
root->right = t->left;
t->left = root;
return t;
}
node *ll_rotate(node *root) {
node *t = root->left;
root->left = t->right;
t->right = root;
return t;
}
node *lr_rotate(node *root) {
root->left = rr_rotate(root->left);
return ll_rotate(root);
}
node *rl_rotate(node *root) {
root->right = ll_rotate(root->right);
return rr_rotate(root);
}
int getHeight(node *root) {
if(root == NULL) return 0;
return max(getHeight(root->left), getHeight(root->right)) + 1;
}
node *insert(node *root, int val) {
if(root == NULL) {
root = new node();
root->val = val;
root->left = root->right = NULL;
} else if(val < root->val) {
root->left = insert(root->left, val);
if(getHeight(root->left) - getHeight(root->right) == 2)
root = val < root->left->val ? ll_rotate(root) : lr_rotate(root);
} else {
root->right = insert(root->right, val);
if(getHeight(root->left) - getHeight(root->right) == -2)
root = val > root->right->val ? rr_rotate(root) : rl_rotate(root);
}
return root;
}
void preOrder(node *root)
{
if(root == NULL) return;
cout << root->val<<" ";
preOrder(root->left);
preOrder(root->right);
}
int main() {
int n, val;
scanf("%d", &n);
node *root = NULL;
for(int i = 0; i < n; i++) {
scanf("%d", &val);
root = insert(root, val);
}
preOrder(root);
return 0;
}