3,881
社区成员
发帖
与我相关
我的任务
分享
/*************************************************************************
> File Name: BsTree.c
> Author: Gnglas
> Mail: 2254228017@qq.com
> Created Time: 2020年01月28日 星期二 23时16分29秒
************************************************************************/
#include<stdio.h>
#include<stdlib.h>
typedef struct Node
{
int nuber;
struct Node *lChild,*rChild;
}node;
//node *root =NULL;
void topTree(node *tree,int var)
{
node *newTree = malloc(sizeof(node));
newTree->nuber = var;
newTree->lChild = NULL;
newTree->rChild = NULL;
if(tree == NULL)
{
tree = newTree;
}
else
{
node *new = tree;
while(new != NULL)
{
if(var < new->nuber)
{
if(new->lChild == NULL)
{
new->lChild = newTree;
return ;
}
else
new = new->lChild;
}
else
{
if(new->rChild == NULL)
{
new->rChild = newTree;
return ;
}
else
new = new->rChild;
}
}
}
}
void xPushTree(node *tree)
{
if(tree != NULL)
{
xPushTree(tree->lChild);
printf("%d\n",tree->nuber);
xPushTree(tree->rChild);
}
}
void main()
{
int Nuber[10] = {10,9,8,7,6,5,4,3,2,1};
node *tree = NULL;
int i;
for(i = 0;i<10;i++)
{
topTree(tree,Nuber[i]);
printf("成功\n");
}
xPushTree(tree);
}