文章
7
粉丝
0
获赞
27
访问
684
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
typedef struct BTNode {
int data;
struct BTNode* lchild;
struct BTNode* rchild;
}BTNode,*BiTree;
//构建一颗二叉搜索树
BiTree createBST(BiTree T, int key,int pre_data,int arr[]) {
if (T == NULL) {
//printf("%d\n", pre_data);
arr[key] = pre_data;
T = malloc(sizeof(BTNode));
T->data = key;
T->lchild = T->rchild = NULL;
return T;
}
if (T->data > key) {
T->lchild = createBST(T->lchild, key,T->data,arr);
}
if (T->data < key) {
&nb...
登录后发布评论
暂无评论,来抢沙发