/061.二叉树遍历
【摘要】
#include <stdio.h> typedef struct bitnode{ char data; struct bitnode *lchild, *rchild;}bitnode, *bitree; void createbitree(t,n)bitnode ** t;int *n;{ char x; bitnod...
-
#include <stdio.h>
-
-
typedef struct bitnode
-
{
-
char data;
-
struct bitnode *lchild, *rchild;
-
}bitnode, *bitree;
-
-
void createbitree(t,n)
-
bitnode ** t;
-
int *n;
-
{
-
char x;
-
bitnode *q;
-
-
*n=*n+1;
-
printf(" Input %d DATA: ",*n);
-
x=getchar();
-
if(x!='\n') getchar();
-
-
if (x=='^')
-
return;
-
-
q=(bitnode*)malloc(sizeof(bitnode));
-
q->data=x;
-
q->lchild=NULL;
-
q->rchild=NULL;
-
*t=q;
-
-
printf("This Address is:%o,Data is:%c, Left Pointer is:%o,Right Pointer is: %o\n",q,q->data,q->lchild,q->rchild);
-
-
createbitree(&q->lchild,n);
-
createbitree(&q->rchild,n);
-
return;
-
}
-
-
void visit(e)
-
bitnode *e;
-
{
-
printf(" Address: %o, Data: %c, Left Pointer: %o, Right Pointer: %o\n",e,e->data,e->lchild,e->rchild);
-
}
-
-
void preordertraverse(t)
-
bitnode *t;
-
{
-
if(t)
-
{
-
visit(t);
-
preordertraverse(t->lchild);
-
preordertraverse(t->rchild);
-
return ;
-
}else return ;
-
}
-
-
void countleaf(t,c)
-
bitnode *t;
-
int *c;
-
{
-
if(t!=NULL)
-
{
-
if (t->lchild==NULL && t->rchild==NULL)
-
{
-
*c=*c+1;
-
}
-
countleaf(t->lchild,c);
-
countleaf(t->rchild,c);
-
}
-
return;
-
}
-
-
int treehigh(t)
-
bitnode *t;
-
{
-
int lh,rh,h;
-
if(t==NULL)
-
h=0;
-
else
-
{
-
lh=treehigh(t->lchild);
-
rh=treehigh(t->rchild);
-
h=(lh>rh ? lh:rh)+1;
-
}
-
-
return h;
-
}
-
main()
-
{
-
bitnode *t; int count=0;
-
int n=0;
-
clrscr();
-
printf("Please initialize the TREE!\n");
-
createbitree(&t,&n);
-
-
printf("\n This is TREE Struct:\n");
-
preordertraverse(t);
-
-
countleaf(t,&count);
-
printf(" This TREE has %d leaves.",count);
-
-
printf("\n High of The TREE is: %d\n",treehigh(t));
-
puts("\n Press any key to quit...");
-
getch();
-
}
文章来源: blog.csdn.net，作者：程序员编程指南，版权归原作者所有，如需转载，请联系作者。
原文链接：blog.csdn.net/weixin_41055260/article/details/124495534
【版权声明】本文为华为云社区用户转载文章，如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）