ds

#include<stdio.h>
//2叉连表存储2查树
typedef struct BiNode
{
int data;
    struct BiNode * left;
struct BiNode * right;
}BiNode,*BiTree;
//创建2叉树
BiTree createBiTree()
{
int x = 0;
BiTree bt;
printf("输入节点的值: ");
scanf("%d",&x);
if(x == 0)
{
bt = NULL;
}
else if(x > 0)
{
bt = (BiNode*)malloc(sizeof(BiNode));
bt ->data = x;
bt ->left = createBiTree();
bt ->right = createBiTree();
}
else
{
printf("error!");
}
return bt;



}
void print(BiTree bt)
{
if(bt!=NULL)
{
printf("%d\t",bt->data);
print(bt->left);
print(bt->right);


}
}
int main()
{
BiTree bt = createBiTree();
print(bt);
return 0;
}