二叉樹(shù)遍歷所有代碼.doc

《二叉樹(shù)遍歷所有代碼.doc》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在教育資源-天天文庫(kù)。

1、#include?#include?#include?#include?#include?#define?SIZE?100using?namespace?std;typedef?struct??BiTNode??????//定義二叉樹(shù)節(jié)點(diǎn)結(jié)構(gòu){?char??data;?????????????????????//數(shù)據(jù)域?struct?BiTNode?*lchild,*rchild;?//左右孩子指針域}BiTNode,*BiTree;int?visit(BiTree?t);#include?

2、io.h>#include?#include?#include?#include?#define?SIZE?100using?namespace?std;typedef?struct??BiTNode??????//定義二叉樹(shù)節(jié)點(diǎn)結(jié)構(gòu){?char??data;?????????????????????//數(shù)據(jù)域?struct?BiTNode?*lchild,*rchild;?//左右孩子指針域}BiTNode,*BiTree;int?visit(BiTree?t);#include?#include

3、?#include?#include?#include?#define?SIZE?100using?namespace?std;typedef?struct??BiTNode??????//定義二叉樹(shù)節(jié)點(diǎn)結(jié)構(gòu){?char??data;?????????????????????//數(shù)據(jù)域?struct?BiTNode?*lchild,*rchild;?//左右孩子指針域}BiTNode,*BiTree;int?visit(BiTree?t);#include?#include?#i

4、nclude?#include?#include?#define?SIZE?100using?namespace?std;typedef?struct??BiTNode??????//定義二叉樹(shù)節(jié)點(diǎn)結(jié)構(gòu){?char??data;?????????????????????//數(shù)據(jù)域?struct?BiTNode?*lchild,*rchild;?//左右孩子指針域}BiTNode,*BiTree;int?visit(BiTree?t);#include?#include?#include?

5、>#include?#include?#define?SIZE?100using?namespace?std;typedef?struct??BiTNode??????//定義二叉樹(shù)節(jié)點(diǎn)結(jié)構(gòu){?char??data;?????????????????????//數(shù)據(jù)域?struct?BiTNode?*lchild,*rchild;?//左右孩子指針域}BiTNode,*BiTree;int?visit(BiTree?t);void?CreateBiTree(BiTree?&T);????//生成一個(gè)二叉樹(shù)void?PreOrder(BiTree);?

6、?????????//遞歸先序遍歷二叉樹(shù)void?InOrder(BiTree);???????????//遞歸中序遍歷二叉樹(shù)void?PostOrder(BiTree);?????????//遞歸后序遍歷二叉樹(shù)void?InOrderTraverse(BiTree?T);?//非遞歸中序遍歷二叉樹(shù)void?PreOrder_Nonrecursive(BiTree?T);//非遞歸先序遍歷二叉樹(shù)void?LeverTraverse(BiTree?T);//非遞歸層序遍歷二叉樹(shù)//主函數(shù)void?main(){?BiTree?T;????????char?j;?int?flag=1;?

7、//---------------------程序解說(shuō)-----------------------?printf("本程序?qū)崿F(xiàn)二叉樹(shù)的操作。");?printf("葉子結(jié)點(diǎn)以空格表示。");?printf("可以進(jìn)行建立二叉樹(shù)，遞歸先序、中序、后序遍歷，非遞歸先序、中序遍歷及非遞歸層序遍歷等操作。");?//----------------------------------------------------?printf("");?p