二叉树的后序遍历

《二叉树的后序遍历》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、二叉树的后序遍历实验代码:#include"stdio.h"#include"stdlib.h"#defineOK1#defineERROR-1#defineTRUE1#defineFALSE0#defineOVERFLOW-2#defineINFEASIBLE-1#defineMAX_TREE_SIZE100//树的最大结点数#defineSTACKINCREMENT10typedefcharElemType;typedefstructBiTNode{ElemTypedata;structBiTNod

2、e*lchild,*rchild;}BiTNode,*BiTree;typedefBiTNode*SElemType;BiTreeCreateTree(){//先序遍历输入二叉树BiTNode*node;chardata;printf("输入结点值（空格字符结束）:");fflush(stdin);scanf("%c",&data);if(data=='')node=NULL;else{3二叉树的后序遍历node=(BiTNode*)malloc(sizeof(BiTNode));node->data=

3、data;node->lchild=CreateTree();node->rchild=CreateTree();}returnnode;}voidHOrderTraverse(BiTreetree){//后续遍历的递归算法if(tree){HOrderTraverse(tree->lchild);HOrderTraverse(tree->rchild);printf("%c",tree->data);}}voidmain(){BiTreeT,p;T=CreateTree();p=T;printf("-

4、-----------后序遍历----------");HOrderTraverse(p);printf("--------------");}3二叉树的后序遍历实验结果:3