#include"stdio.h"
#include"stdlib.h"
#define OK 1
typedef char TElemType;
typedef int Status;
char ch;
typedef struct BiNode{
TElemType data;
struct BiNode *lchild,*rchild;
}BiNode,*BiTree;
//后序遍历创建二叉树
void CreateBiTree(BiTree &T){
scanf("%c",&ch);
if(ch=='#'){
T=NULL;
}
else{
T=(BiNode*)malloc(sizeof(BiNode));
T->data=ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
Status PostOrderTraverse(BiTree T){
if(T==NULL) return OK;
else{
PostOrderTraverse(T->lchild);
PostOrderTraverse(T->rchild);
printf("%c",T->data);
}
}
int main(){
BiTree T;
CreateBiTree(T);
PostOrderTraverse(T);
return 0;
}
【数据结构】二叉树的后序遍历
最新推荐文章于 2024-08-13 09:16:27 发布