二叉排序树1

二叉排序树，是一种规整的二叉树。每个节点的左子树都小于他，每个节点的右子树都大于他。

二叉树的遍历：

void InOrderTree(BTree *b){
    if( !b )
        return;
    InOrderTree(b->lchild);
    printf("%d ",b->data);
    InOrderTree(b->rchild);
}

二叉树的查找：

int searchTree(BTree *b,int key,BTree *f,BTree *&p){
    if(!b){
        p = f;
        return 0;
    }
    else if( key == b->data){
        p = b;
        return 1;
    }
    else if(key > b->data)
        return searchTree(b->rchild,key,b,p);
    else
        return searchTree(b->lchild,key,b,p);
}

二叉树的插入：

bool insertTree(BTree *b,int key){
    BTree *p,*s;
    if(!searchTree(b,key,NULL,p)){
        s = (BTree *)malloc(sizeof(BTree));
        s->data = key;
        s->lchild = s->rchild = NULL;
        if(!b){
            b = s;
        }
        else if(key < p->data){
            p->lchild = s;
        }else{ 
            p->rchild = s;
        }
        return true;
    }else
        return false;
}

全部代码：

#include <stdio.h>
#include <stdlib.h>
typedef struct bTree{
    int data;
    struct bTree *lchild,*rchild;
}BTree;

void initialTree(BTree *b);
bool insertTree(BTree *b,int key);
int searchTree(BTree *b,int key,BTree *f,BTree *&p);
void InOrderTree(BTree *b);

int main(){
    BTree *b = (BTree *)malloc(sizeof(BTree));
    b->data = 5;
    b->lchild = b->rchild = NULL;
    initialTree(b);
    InOrderTree(b);
    getchar();
    return 0;
}

void InOrderTree(BTree *b){
    if( !b )
        return;
    InOrderTree(b->lchild);
    printf("%d ",b->data);
    InOrderTree(b->rchild);
}

void initialTree(BTree *b){
    insertTree(b,5);
    insertTree(b,3);
    insertTree(b,6);
    insertTree(b,2);
    insertTree(b,1);
    insertTree(b,8);
}
int searchTree(BTree *b,int key,BTree *f,BTree *&p){
    if(!b){
        p = f;
        printf("++%d
",p->data);
        return 0;
    }
    else if( key == b->data){
        p = b;
        printf("--%d 
",p->data);
        printf("找到元素key:%d
",key);
        return 1;
    }
    else if(key > b->data)
        return searchTree(b->rchild,key,b,p);
    else
        return searchTree(b->lchild,key,b,p);
}
bool insertTree(BTree *b,int key){
    BTree *p,*s;
    if(!searchTree(b,key,NULL,p)){
        printf("%d 没有出现在树中，可以插入在%d之后
",key,p->data);
        s = (BTree *)malloc(sizeof(BTree));
        s->data = key;
        s->lchild = s->rchild = NULL;
        if(!b){
            b = s;
        }
        else if(key < p->data){
            p->lchild = s;
        }else{ 
            p->rchild = s;
        }
        return true;
    }else
        return false;
}

运行示例：