void swap(int *a,int *b){
int temp=*a;
*a=*b;
*b=temp;
}
int parent(int i){
return (i-1)/2;
}
void shitf_up(binary_tree *s,int pos){
int Parent=parent(pos);
if (pos>0 && (s->val[pos] > s->val[Parent])){
swap(&s->val[pos],&s->val[Parent]);
shitf_up(&s,Parent);
}
return;
}
Простой
