#include<stdio.h>
#include<malloc.h>
#define NULL 0

typedef struct bitnode
{ char data;
struct bitnode *lchild;
struct bitnode *rchild;
}bitnode;

void (*visit)() /*define a function pointer*/

bitnode *CreatBitree(bitnode *T)
{ char ch;
bitnode *p=NULL;
p=(bitnode*)malloc(sizeof(bitnode));
printf("Enter letters:");
scanf("%c",&ch);

if(ch==' ')
{
p=NULL;
T=p;
}
else
{
if(!p)
printf("Init error!");
else
{
T=p;
T->data=ch;
T->lchild=CreatBittree(T->lchild);
T->rchild=CreatBittree(T->rchild);
}
}
return(T);
}

void PrintElem(char e)
{
printf("%c",e);
}

void PreTra(bitnode *T,visit)
{
if(T) visit(T->data);
if(T->lchild) PreTra(T->lchild,PrintElem);
if(T->rchild) PreTra(T->lchild,PrintElem);
else
printf("Can't visit rchild.");

}

void main()
{ bitnode *T;
bitnode *T1;
T1=CreatBitree(T);
PreTrv(T,PrintElem);
}

#include "malloc.h"
#include "stdio.h"
#define OK 1
#define ERROR 0
#define OVERFLOW -2

typedef char TElemType;
typedef int Status;
typedef struct BiNode{
TElemType data;
struct BiNode *lchild, *rchild;
}BiNode, *BiTree;

Status pnt(TElemType e){
printf(" %c",e);//打印
return OK;
}//pnt

Status PreOrderTraverse(BiTree T, Status (*Visit)(TElemType e)){
if(T){
if(pnt(T->data))
if(PreOrderTraverse(T->lchild, Visit))
if(PreOrderTraverse(T->rchild, Visit))
return OK;
return ERROR;
}
else
return OK;
}//PreOrderTraverse

Status InOrderTraverse(BiTree T, Status (*Visit)(TElemType e)){
if(T){
if(InOrderTraverse(T->lchild, Visit))
if(pnt(T->data))
if(InOrderTraverse(T->rchild, Visit))
return OK;
return ERROR;
}
else
return OK;
}//InOrderTraverse

Status CreatBiTree(BiTree &T){
char ch;
scanf("%c", &ch);
if(ch=='#')
T=NULL;
else{
if(!(T=(BiNode *)malloc(sizeof(BiNode))))
return OVERFLOW;
T->data=ch;
CreatBiTree(T->lchild);
CreatBiTree(T->rchild);
}
return OK;
}//CreatBiTree

void main(){
BiTree T;
CreatBiTree(T);
printf("\n");
PreOrderTraverse(T, pnt);
printf("\n");
InOrderTraverse(T, pnt);
}

这个我写的一个和你功能一样的程序 只是加多了个中序遍历
运行成功的
你看看吧

[此贴子已经被作者于2005-10-30 14:38:09编辑过]

kao 这么强

什么时候能和你们一样

啊