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

typedef struct node
{
    int nr;
    struct drzewo *nast;
    struct drzewo *prev;
}node;

typedef node *tree;

tree ADD_NODE(tree k)
{
    tree tmp;
    tree tmp2;
    tmp=malloc(sizeof(node));
    if(k->nast==NULL)
    {
        tmp=k->nast;
        tmp->nr=k->nr+1;
        printf("OK");
    }
    else
    {
        tmp->prev=k->nast;
        k->nast=tmp;
        tmp2=k->prev;
        k->nr=tmp2->nr;
        printf("OK");
    }
    return k;
}

/*int RIGHTMOST_CHILD(tree k)
{
    if(k->nast==NULL)
    {
        printf("-1");
        return -1;
    }
    else
    {
        printf("%d", k->nast->nr);
        return k->nast->nr;
    }
}

int DELETE_NODE(tree k)
{
    if(k->nast!=NULL)
    {
        DELETE_NODE(k->nast);
    }
    if(k->prev!=NULL)
    {
        DELETE_NODE(k->prev);
    }
    free(k);
}*/

int DELETE_SUBTREE(tree k)
{
    ;
}

int SPLIT_NODE(tree k, tree w)
{
    ;
}

int main(void)
{
    tree t;
    t=malloc(sizeof(node));
    t->nr=0;
    ADD_NODE(t);
    ADD_NODE(t);
    //DELETE_NODE(t);
    return 0;
}