题目描述
![在这里插入图片描述](https://img-blog.csdnimg.cn/20210216103028898.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FhcWFxYTY2Ng==,size_16,color_FFFFFF,t_70)
分析:
平衡二叉树例题,还是有一定难度,比较复杂的,不过直接输出中位数也可以得到一定分数。
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
int v,height;
node *lchild,*rchild;
}*root;
node* newNode(int v){
node* Node=new node;
Node->v=v;
Node->height=1;
Node->lchild=Node->rchild=NULL;
return Node;
}
int getHeight(node* root){
if(root==NULL) return 0;
return root->height;
}
void updateHeight(node* root){
root->height=max(getHeight(root->lchild),getHeight(root->rchild))+1;
}
int getBalanceFcator(node* root){
return getHeight(root->lchild)-getHeight(root->rchild);
}
void L(node* &root){
node* temp=root->rchild;
root->rchild=temp->lchild;
temp->lchild=root;
updateHeight(root);
updateHeight(temp);
root=temp;
}
void R(node* &root){
node* temp=root->lchild;
root->lchild=temp->rchild;
temp->rchild=root;
updateHeight(root);
updateHeight(temp);
root=temp;
}
void insert(node* &root,int v){
if(root==NULL){
root=newNode(v);
return ;
}
if(v<root->v){
insert(root->lchild,v);
updateHeight(root);
if(getBalanceFcator(root)==2){
if(getBalanceFcator(root->lchild)==1)
{
R(root);
}
else if(getBalanceFcator(root->lchild)==-1)
{
L(root->lchild);
R(root);
}
}
}
else{
insert(root->rchild,v);
updateHeight(root);
if(getBalanceFcator(root)==-2){
if(getBalanceFcator(root->rchild)==-1)
{
L(root);
}
else if(getBalanceFcator(root->rchild)==1)
{
R(root->rchild);
L(root);
}
}
}
}
node* Create(int data[],int n){
node* root=NULL;
for(int i=0;i<n;i++){
insert(root,data[i]);
}
return root;
}
int main(){
int n,v;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&v);
insert(root,v);
}
printf("%d\n",root->v);
return 0;
}