#2
word1232019-04-23 10:18
|
程序代码:
#include <stdio.h>
#include <stdlib.h>
typedef char ElemType;
typedef struct BiTNode
{
char date;
struct BiTNode *lchild, *rchild;
}BiTNode, *BiTree;
CreateBiTree(BiTree *T)
{
char c;
scanf("%c",&c);
if('#'== c)
{
*T= NULL;
}
else
{
*T=(BiTNode *)malloc(sizeof(BiTNode));
(*T)->date = c;
CreateBiTree(&(*T)->lchild);
CreateBiTree(&(*T)->rchild);
}
}
visit(char c)
{
printf("%c",&c);
}
PreDrderTraverse(BiTree T)
{
if(T)
{
visit(T->date);
PreDrderTraverse(T->lchild);
PreDrderTraverse(T->rchild);
}
}
int main()
{
BiTree T = NULL;
CreateBiTree(&T);
PreDrderTraverse( T );
return 0;
}
#include <stdlib.h>
typedef char ElemType;
typedef struct BiTNode
{
char date;
struct BiTNode *lchild, *rchild;
}BiTNode, *BiTree;
CreateBiTree(BiTree *T)
{
char c;
scanf("%c",&c);
if('#'== c)
{
*T= NULL;
}
else
{
*T=(BiTNode *)malloc(sizeof(BiTNode));
(*T)->date = c;
CreateBiTree(&(*T)->lchild);
CreateBiTree(&(*T)->rchild);
}
}
visit(char c)
{
printf("%c",&c);
}
PreDrderTraverse(BiTree T)
{
if(T)
{
visit(T->date);
PreDrderTraverse(T->lchild);
PreDrderTraverse(T->rchild);
}
}
int main()
{
BiTree T = NULL;
CreateBiTree(&T);
PreDrderTraverse( T );
return 0;
}
只有本站会员才能查看附件,请 登录