用C语言编写程序，创建一个二叉树的二叉链表结构，然后输出从根结点到所有叶子结点的路径。

Question

寻求完整的程序

Answer 1

#include
#include
#include
typedef
struct
node
{
char
data;
struct
node
*lchild;
struct
node
*rchild;
}tnode;
tnode
*createtree()
{
tnode
*t;
char
ch;
ch=getchar();
if(ch=='0')
t=null;
else
{
t=(tnode
*)malloc(sizeof(tnode));
t->data=ch;
t->lchild=createtree();
t->rchild=createtree();
}
return
t;
}
void
listtree(tnode
*t)
{
if
(t!=null)
{
printf("%c",t->data);
if(t->lchild!=null||t->rchild!=null)
{
printf("(");
listtree(t->lchild);
if(t->rchild!=null)
printf(",");
listtree(t->rchild);
printf(")");
}
}
}
void
inorder(tnode
*t)
{
if(t!=null)
{
inorder(t->lchild);
printf("%c\t",t->data);
inorder(t->rchild);
}
}
void
leve(tnode
*t)
{
tnode
*quee[100];
int
front,rear;
front=-1;
rear=0;
quee[rear]=t;
while(front!=rear)
{
front++;
printf("%c\t",quee[front]->data);
if(quee[front]->lchild!=null)
{
rear++;
quee[rear]=quee[front]->lchild;
}
if(quee[front]->rchild!=null)
{
rear++;
quee[rear]=quee[front]->rchild;
}
}
}
main()
{
tnode
*t=null;
printf("请输入二叉树元素：");
t=createtree();
printf("广义表的输出：");
listtree(t);
printf("\n");
printf("二叉树的中序遍历：");
inorder(t);
printf("\n");
printf("二叉树的层次遍历：");
leve(t);
printf("\n");
system("pause");
}
/*
输入：ab00cd00e00f000
输出：a(b,c((d,e))
中序遍历：
b
a
d
c
e
层次遍历：a
b
c
d
e
*/

Answer 2

#include <stdio.h>
#include <stdlib.h>
typedef struct BTnode
{
char data;
struct BTnode *lchild,*rchild;
}BTNode;
#define NodeLen sizeof(BTNode)
BTNODE *Creat_Bt(void);
void Preorder(BTNode *bt);
void Inorder(BTNode *bt);
int count,deep;
main()
{
BTNode *t;
char s[10];
for(;;)
{
printf("1----------建立二叉树
2----------先中根遍历二叉树\n
3----------求叶子数和树深
4----------退出\n);
gets(s);
switch(*s)
{
case'1':t=Creat_Bt();break;
case'2':Preorder(t);printf("\n");break;
case'3':count=deep=0;
Leafs_deep(t,0);printf("\n叶子结点数：%d\n"count);printf("树深：%d\n",deep);break;
case'4':exit(0);
}
}

Answer 3

typedef int DataType;
typedef struct BNode{
DataType data;
struct BNode *left,*right;
}* LinkTree;
#include <stdio.h>
#include <stdlib.h>
int LinkTreeCreate(LinkTree *T)
{
DataType d;

scanf("%d",&d);
if (d == 0)
*T = NULL;
else
{
if ((*T = (struct BNode*)malloc(sizeof(struct BNode))) == NULL)
return -1;
(*T)->data = d;
if (LinkTreeCreate(&(*T)->left) == -1)
return -1;
if (LinkTreeCreate(&(*T)->right) == -1)
return -1;
}
return 0;
}
struct PNode{
struct BNode *ptr;
int flag;
};
typedef struct{
struct PNode *bottom;
int stacksize;
int top;
} SeqStack;
#define INCREMENT 10
int SeqStackPush(SeqStack *S,struct PNode d)
{
if (S->top == S->stacksize)
{
if ((S->bottom = (struct PNode*)realloc(S->bottom,(S->stacksize+INCREMENT)*sizeof(struct PNode))) == NULL)
return -1;
S->stacksize += INCREMENT;
}
S->bottom[S->top++] = d;
return 0;
}
int SeqStackPop(SeqStack *S,struct PNode *d)
{
if (S->top == 0)
return -1;
*d = S->bottom[--S->top];
return 0;
}
#define STACKSIZE 100
void LinkTreeTraverse(LinkTree T)
{
SeqStack S;
struct PNode p;

S.bottom = (struct PNode*)malloc(STACKSIZE*sizeof(struct PNode));
S.stacksize = STACKSIZE;
S.top = 0;
p.ptr = T;
p.flag = 0;
while (S.top >= 0)
if (p.ptr != NULL)
{
SeqStackPush(&S,p);
p.ptr = p.ptr->left;
p.flag = 0;
}
else
{
if (SeqStackPop(&S,&p) == -1)
break;
if (p.flag == 0)
{
p.flag = 1;
SeqStackPush(&S,p);
p.ptr = p.ptr->right;
p.flag = 1;
}
else
{
printf("%t",p.ptr->data);
p.ptr = NULL;
}
}
}
void main(void)
{
LinkTree T;

LinkTreeCreate(&T);
LinkTreeTraverse(T);
}
输入2 3 0 0 5 8 0 1 0 0 0
输出18532

Answer 4

meng