struct ElemType{
char a;
};
typedef struct BITNode{
char data;
struct BITNode *lchild,*rchild;
}BITNode,*BITtree;
//
void CreatBitnode( BITtree *T){
char ch;
ch=getchar();
if(ch=='#')
T=NULL;
else
T=(BITNode *)malloc(sizeof(BITNode ));
T->data = ch;
T->lchild=CreatBitnode(T->lchild);
T->rchild=CreatBitnode(T->rchild);
}
void preBITnode(BITtree *T){
if(T!=NULL){
printf("%c",T->data);
preBITnode(T->lchild);
preBITnode(T->rchild);
}
}
int main(){
BITtree T=NULL;
CreatBitnode(T);
preBITnode(T);
}
用链式存储方式构建二叉树
最新推荐文章于 2022-10-13 19:00:11 发布