顺序二叉树实现

#include"stdio.h"  
#include"stdlib.h"  
#include"iostream"

typedef struct bstnode{
    int data;
    struct bstnode *lchild;
    struct bstnode *rchild;
}bstnode, *BSTree; //结构体类型,BSTree为结构体指针

//函数声明区
BSTree create_BSTree(int *arr, int len);
BSTree search(BSTree pTree, int key);
void in_traverse(BSTree pTree);
bool search_BSTree(BSTree pTree, int key, BSTree parent, BSTree &p);
bool insert(BSTree &pTree, int key);

//根据所给的长为len的arr数组，按数组中元素的顺序构建一棵二叉排序树
BSTree create_BSTree(int *arr, int len) {
    BSTree pTree = NULL;  //初始化树为空树
    int i;
    for (i = 0; i<len; i++)
        insert(pTree, arr[i]);  //
    return pTree;   //将数组中的数插入后返回
}

void in_traverse(BSTree pTree) {
    if (pTree){      //如果树不为空则中序递归的打印出树中的元素
        if (pTree->lchild)
            in_traverse(pTree->lchild);
        printf("%d ", pTree->data);
        if (pTree->rchild)
            in_traverse(pTree->rchild);
    }
}

BSTree search(BSTree pTree, int key){
    if (!pTree || pTree->data == key)   //如果树不为空，
        return pTree;
    else if (key < pTree->data)        //如果key的值小于data,则往左搜索，否则往右，递归的进行
        return search(pTree->lchild, key);
    else                              
        return search(pTree->rchild, key);
}

bool search_BSTree(BSTree pTree, int key, BSTree parent, BSTree &p){     //用于查找到inset函数要用到的待插入元素位置的指针
    if (!pTree){     //如果树中没有元素，直接返回根节点
        p = parent;
        return false;
    }
    else {
        if (key == pTree->data){
            p = pTree;   //p保存访问的最后一个结点指针
            return true;
        }
        else if (key < pTree->data)
            return search_BSTree(pTree->lchild, key, pTree, p);
        else                       
            return search_BSTree(pTree->rchild, key, pTree, p);
    }
}

bool insert(BSTree &pTree, int key){
    BSTree p;
    if (!search_BSTree(pTree, key, NULL, p)){
        BSTree pNew = (BSTree)malloc(sizeof(bstnode));
        pNew->data = key;
        pNew->lchild = pNew->rchild = NULL;   //分配一个新节点
        if (!p)                        
            pTree = pNew;
        else if (key < p->data)         
            p->lchild = pNew;          
        else
            p->rchild = pNew;
    }
    else
        return false;
}
void delete_bstnode1(BSTree &p){
    BSTree q, s;
    if (!p->lchild){  
        q = p;
        p = p->rchild;
        free(q);
    }
    else if (!p->rchild){  
        q = p;
        p = p->lchild;
        free(q);
    }
    else{     
        s = p->lchild;      
        while (s->rchild)
            s = s->rchild;
        s->rchild = p->rchild;  
        q = p;
        p = p->lchild;    
        free(q);
    }
}

bool delete_BSTree(BSTree &pTree, int key){
    if (!pTree)
        return false;
    else{
        if (key == pTree->data){
            delete_bstnode1(pTree);
            return true;
        }
        else if (key < pTree->data)  
            return delete_BSTree(pTree->lchild, key);
        else                       
            return delete_BSTree(pTree->rchild, key);
    }
}

void main(){
    int i;
    int num;
    printf("请输入节点个数：");
    scanf_s("%d", &num);
    int *arr = (int *)malloc(num * sizeof(int));
    printf("请依次输入这%d个整数（必须互不相等）：", num);
    for (i = 0; i<num; i++)
        scanf_s("%d", arr + i);
    BSTree pTree = create_BSTree(arr, num);
    printf("中序遍历该二叉排序树的结果：");
    in_traverse(pTree);
    printf("\n");
    int key;
    printf("请输入要查找的整数：");
    scanf_s("%d", &key);
    if (search(pTree, key))
        printf("查找成功，%d存在\n",key);
    else
        printf("查找不到该整数\n");
    printf("请输入要插入的整数：");
    scanf_s("%d", &key);
    if (insert(pTree, key)){
        printf("插入成功，插入后的中序遍历结果：");
        in_traverse(pTree);
        printf("\n");
    }
    else
        printf("插入失败，该二叉排序树中已经存在整数%d\n", key); 
    printf("请输入要删除的整数：");
    scanf_s("%d", &key);
    if (delete_BSTree(pTree, key)){
        printf("删除成功，插入后的中序遍历结果：");
        in_traverse(pTree);
        printf("\n");
    }
    else
        printf("删除失败，该二叉排序树中不存在整数%d\n", key);
    system("pause");
}