C 语言实现二叉树的基本操作
(1)节点的定义
typedefstructBTNode{
intdata;
structBTNode *lChild;
structBTNode *rChild;
}BiTNode;
(2)二叉树的创建
//先序创建二叉树
intCreateBiTree(BiTNode **T)
{
intch;
scanf("%d",&ch);
if(ch== -1)
{
*T= NULL;
return0;
}
else
{
*T= (BiTNode *)malloc(sizeof(BiTNode));
if(T== NULL)
{
printf("failed\n");
return0;
}
else
{
(*T)->data= ch;
printf("输入%d的左子节点:",ch);
CreateBiTree(&((*T)->lChild));
printf("输入%d的右子节点:",ch);
CreateBiTree((&(*T)->rChild));
}
}
return1;
}
(3)先序遍历二叉树
//先序遍历二叉树
voidPreOrderBiTree(BiTNode *T)
{
if(T== NULL)
{
return;
}
else
{
printf("%d ",T->data);
PreOrderBiTree(T->lChild);
PreOrderBiTree(T->rChild);
}
}
(4)中序遍历二叉树
//中序遍历二叉树
voidMiddleOrderBiTree(BiTNode *T)
{
if(T== NULL)
{
return;
}
else
{
MiddleOrderBiTree(T->lChild);
printf("%d ",T->data);
MiddleOrderBiTree(T->rChild);
}
}
(5)后续遍历二叉树
//后续遍历二叉树
voidPostOrderBiTree(BiTNode *T)
{
if(T== NULL)
{
return;
}
else
{
PostOrderBiTree(T->lChild);
PostOrderBiTree(T->rChild);
printf("%d ",T->data);
}
}
(6)二叉树的深度
//二叉树的深度
intTreeDeep(BiTNode *T)
{
intdeep= 0;
if(T!= NULL)
{
intleftdeep= TreeDeep(T->lChild);
intrightdeep= TreeDeep(T->rChild);
deep= leftdeep>= rightdeep?leftdeep+1:rightdeep+1;
}
returndeep;
}
(7)叶子节点个数
//叶子节点个数
intLeafCount(BiTNode *T)
{
staticintcount;
if(T!= NULL)
{
if(T->lChild== NULL&& T->rChild== NULL)
{
count++;
}
LeafCount(T->lChild);
LeafCount(T->rChild);
}
returncount;
}
(8)测试函数
//主函数
intmain(intargc,constchar*argv[])
{
BiTNode *T;
intdepth,leafCount= 0;
printf("请输入第一个节点的值,-1表示没有叶节点:\n");
CreateBiTree(&T);
printf("先序遍历二叉树:");
PreOrderBiTree(T);
printf("\n");
printf("中序遍历二叉树:");
MiddleOrderBiTree(T);
printf("\n");
printf("后续遍历二叉树:");
PostOrderBiTree(T);
printf("\n");
depth= TreeDeep(T);
printf("树的深度为:%d\n",depth);
leafCount= LeafCount(T);
printf("叶子节点个数:%d\n",leafCount);
return0;
}