poj 3481 AVL 平衡二叉树

平衡二叉树的简单应用:

#include <stdio.h>
#include <stdlib.h>

typedef struct node
{
    int k, p;
    struct node *next, *prior;
}AVL;
AVL *head, *last;

AVL *creat()
{
    AVL *s;
    s = (AVL *)malloc(sizeof(AVL));
    s->next = s->prior = NULL;
    return s;
}
void inseart(int k, int p)
{
    AVL *q = head->prior, *n = head->next, *r;
    r = (AVL *)malloc(sizeof(AVL));
    r->k = k;
    r->p = p;
    if(n == last)
    {
        head->next = r;
        r->next = last;
        r->prior = head;
        last->prior = r;
    }
    else
    {
        while(n->next)
        {
            if(p<n->p && n==head->next)
            {
                head->next = r;
                r->next = n;
                r->prior = head;
                n->prior = r;
                break;
            }
            if(p<n->p && p>n->prior->p)
            {
                n->prior->next = r;
                r->prior = n->prior;
                r->next = n;
                n->prior = r;
                break;
            }
            if(p>n->p && n==last->prior)
            {
                n->next = r;
                r->prior = last->prior;
                r->next = last;
                last->prior = r;
                break;
            }
            n = n->next;
        }
    }
}

void printmax()
{
    AVL *s = head->next;
    if(head->next == last)
        printf("0\n");
    else
    {
        printf("%d\n",s->k);
        s->next->prior = head;
        head->next = s->next;
        free(s);
    }
}

void printmin()
{
    AVL *s = last->prior;
    if(last->prior == head)
        printf("0\n");
    else
    {
        printf("%d\n",s->k);
        s->prior->next = last;
        last->prior = s->prior;
        free(s);
    }
}

int main()
{
    int n, k, p;
    head = creat();
    last = creat();
    head->next = last;
    last->prior = head;
    while(scanf("%d", &n) && n)
    {
        if(n == 1)
        {
            scanf("%d%d", &k, &p);
            inseart(k, p);
        }
        else if(n == 2)
            printmin();
        else printmax();
    }

    return 0;
}