binary search tree

试试出乱码不 지금이  하하하하 느낌이 너무 촣아 ㅋㅋㅋㅋ So beast!

///之前写的在删节点时 都没有维持二叉排序树的形态 所以重写一遍 还挺好玩的

#include<iostream>
using namespace std;
typedef struct treenode
{
    int data;
    treenode *lchild;
    treenode *rchild;
}node, *Tree;
int head, tail;
node *q[100];
int flag;
void insert_node(node * t, node *child)
{
    if(child->data <= t->data && t->lchild == NULL)
    {
        t->lchild = child;
    }
    else if(child->data > t->data && t->rchild == NULL)
    {
        t->rchild = child;
    }
    else if(child->data <=t->data && t->lchild)
    {
        insert_node(t->lchild, child);
    }
    else if(child->data > t->data && t->rchild)
    {
        insert_node(t->rchild, child);
    }
}
void create_tree(Tree &t, int *arr)
{
    t = new node;
    t->lchild = NULL;
    t->rchild = NULL;
    t->data = arr[0];
    for(int i=1; i<10; i++)
    {
        node *child;
        child = new node;
        child->lchild = NULL;
        child->rchild = NULL;
        child->data = arr[i];
        insert_node(t, child);
    }
    ///while(arr != NULL)
}
void level_order(node *t)
{
    head = 0;
    tail = 0;
    if(t)
    {
        q[tail++] = t;
        while(head!=tail)
        {
            node *a = q[head];
            head++;
            cout << a->data << ' ' ;
            if(a->lchild)
                q[tail++] = a->lchild;
            if(a->rchild)
                q[tail++] = a->rchild;
        }
    }
}
void in_order(node *t)
{
    if(t)
    {
        in_order(t->lchild);
        cout << t->data << ' ';
        in_order(t->rchild);
    }
}
///一看就得用BFS
node *point(node *t, int n)
{
    if(t)
    {
        head = 0;
        tail = 0;
        q[tail++] = t;
        while(head!=tail)
        {
            node *a = q[head];
            head++;
            if(a->data == n)
                return a;
            if(a->lchild)
                q[tail++] = a->lchild;
            if(a->rchild)
                q[tail++] = a->rchild;
        }

    }
}
node *parent(node *t, node *p)///竟然崩掉了
{
    if(t)
    {
        head = 0;
        tail = 0;
        q[tail++] = t;
        while(head!=tail)
        {
            node *a = q[head];
            head++;
            if(a->lchild && a->lchild->data == p->data)
            {
                flag = 0;
                return a;
            }
            else if(a->rchild && a->rchild->data == p->data)
            {
                flag = 1;
                return a;
            }
            if(a->lchild)
                q[tail++] = a->lchild;
            if(a->rchild)
                q[tail++] = a->rchild;
        }
    }
    return NULL;///没找着的情况下，没返回空指针，直接崩掉
}
void delete_node(Tree &t, int n)
{
    node *p = point(t, n);
    ///find it
    cout << p->data << endl;

    node *q = parent(t, p);
    if(q == NULL)
        cout << "NULL"  << endl;
    else
        cout << q->data << endl;
    cout << flag << endl;
    if(q && flag == 0)///on the left
    {
        cout << "1" << endl;
        if(p->lchild == NULL && p->rchild == NULL)
        {
            q->lchild = NULL;
            delete p;
        }
        else if(p->lchild == NULL && p->rchild)
        {
            q->lchild = p->rchild;
            delete p;
        }
        else if(p->lchild && p->rchild == NULL)
        {
            q->lchild = p->lchild;
            delete p;
        }
        else if(p->lchild && p->rchild)
        {
            q->lchild = p->lchild;
            if(p->lchild->rchild)
            {
                node *tmp = p->rchild;
                while(tmp->lchild)
                {
                    tmp = tmp->lchild;
                }

                tmp->lchild = p->lchild->rchild;
            }

            p->lchild->rchild = p->rchild;
            delete p;
        }
    }
    else if(q && flag)
    {
        if(p->lchild == NULL && p->rchild == NULL)
        {
            q->rchild = NULL;
            delete p;
        }
        else if(p->lchild == NULL && p->rchild)
        {
            q->rchild = p->rchild;
            delete p;
        }
        else if(p->lchild && p->rchild == NULL)
        {
            q->rchild = p->lchild;
            delete p;
        }
        else if(p->lchild && p->rchild)
        {
            q->rchild = p->lchild;
            if(p->lchild->rchild)
            {
                node*tmp;
                tmp = p->rchild;
                while(tmp->lchild)
                {
                    tmp = tmp->lchild;
                }
                tmp->lchild = p->lchild->rchild;
            }
            p->lchild->rchild = p->rchild;
            delete p;
        }

    }
    else if(q == NULL)
    {
        if(p->lchild == NULL && p->rchild == NULL)
        {
            t = NULL;
            delete p;
        }
        else if(p->lchild == NULL && p->rchild)
        {
            t = p->rchild;
            delete p;
        }
        else if(p->lchild && p->rchild == NULL)
        {
            t = p->lchild;
            delete p;
        }
        else if(p->lchild && p->rchild)
        {
            ///if(p->lchild->data <= p->rchild->data)
            ///unnecessary  hahaha 笑死了 本来左边就比右边小啊
            ///注意比较孩子间大小关系 不难发现。。。
            t = p->lchild;
            ///给p->lchild->rchild找位置
            if(p->lchild->rchild)
            {
                if(p->lchild->lchild)
                {
                    node *tmp;
                    tmp = p->lchild->lchild;
                    while(tmp->rchild)
                    {
                        tmp = tmp->rchild;
                    }
                    tmp->rchild = p->lchild->rchild;
                }
                else
                {
                    node *tmp;
                    tmp = p->rchild;
                    while(tmp->lchild)
                    {
                        tmp = tmp->lchild;
                    }
                    tmp->lchild = p->lchild->rchild;
                }
            }
            p->lchild->rchild = p->rchild;


            ///哈哈哈哈 完成
            delete p;

        }
    }
}
int main()
{
    int arr[11] = {4,1,45,78,345,23,12,3,6,21};
    Tree t;
    create_tree(t, arr);
    cout << "the level_order is:" << endl;
    level_order(t);
    cout << endl;
    cout << "in_order is:" << endl;
    in_order(t);
    cout << endl;
    ///再插一个
    /*node *p = new node;
    p->lchild = NULL;
    p->data = 8;
    p->rchild = NULL;
    insert_node(t, p);*/
    in_order(t);
    cout << endl;
    ///其实吧 有的时候挺迷糊的 这里没加返回值 也没引用啥的
    ///但是8确实是插进去了 学海无涯 男神做粥 好吃~
    ///删掉值为XX的某节点
    while(1)
    {
        int a;
        cin >> a;
        delete_node(t, a);
        cout << "level_order is:" << endl;
        level_order(t);
        cout << endl;
        cout << "in_order is:" << endl;
        in_order(t);
    }

}

/*
the level_order is:
4 1 45 3 23 78 12 345 6 21
in_order is:
1 3 4 6 12 21 23 45 78 345
1 3 4 6 12 21 23 45 78 345
78
78
45
1
level_order is:
4 1 45 3 23 345 12 6 21
in_order is:
1 3 4 6 12 21 23 45 345 21
21
12
1
level_order is:
4 1 45 3 23 345 12 6
in_order is:
1 3 4 6 12 23 45 345 4
4
NULL
1
level_order is:
1 45 23 345 12 6 3
in_order is:
1 3 6 12 23 45 345 1
1
NULL
1
level_order is:
45 23 345 12 6 3
in_order is:
3 6 12 23 45 345 12
12
23
0
1
level_order is:
45 23 345 6 3
in_order is:
3 6 23 45 345 45
45
NULL
0
level_order is:
23 6 345 3
in_order is:
3 6 23 345
*/