二叉树的生成广度遍历前序遍历后序遍历中序遍历.docVIP

// btree.cpp : 定义控制台应用程序的入口点。 // #include stdafx.h #includeiostream #includefstream #includequeue #includestack using namespace std; ifstream is(data.txt); typedef struct SBTNode{ int data; int deep; SBTNode * lt; SBTNode * rt; }BTNode, *BTree; BTree createBTree(){ static int deep=0; //coutdeep is deependl; int a; BTree t = new BTNode; is a; //coutdata is a endl; if(a == 0){deep--;return 0;} else{ t-data = a; t-deep=deep; deep++; //coutstart to create a new left node for t-datadeep is deependl; t-lt=createBTree(); deep++; //coutstart to create a new right node for t-datadeep is deependl; t-rt=createBTree(); } deep--; return t; }  void printTreeGD(BTree t){ //BTree root =t; queueBTree q; q.push(t); while(1){ BTree t1=q.front(); while( t1==NULL){ q.pop(); if(q.empty())return; t1=q.front(); } cout t1-data(t1-deep)endl; q.push(t1-lt); q.push(t1-rt); q.pop(); } } int PreOdrderTraverse0(BTree t){ if(t){ coutdata is t-data in t-deependl; if(PreOdrderTraverse0(t-lt)) if(PreOdrderTraverse0(t-rt))return 1; return -1; } else return 1; } int PreOdrderTraverse1(BTree t,queueBTree q){ stackBTree s; BTree p; s.push(t); int i=0; while(!s.empty()){ while( ( p = s.top() ) p) { coutdata is p-data in p-deependl; q.push(p); i++; s.push(p-lt); } s.pop(); if(!s.empty()){ p=s.top(); s.pop(); s.push(p-rt); } } return i; } void InOrderTraverse0(BTree t){ stackBTree s; BTree p; s.push(t); while(!s.empty()){ while( ( p = s.top() ) p) s.push(p-lt); s.pop(); if(!s.empty()){ p=s.top(); s.pop(); coutdata is p-data in p-deependl; s.push(p-rt); } } } void InOrderTraverse1(BTree t,queueBTree q){ stackBTree s; BTree p =t; while(p||!s.empty()){ if(p){ s.push(p);p=p-lt; } else{ p=s.top(); s.pop(); coutdata is p-data in p-deependl; q.push(p); p=p-rt; } } } void ProstOrderTraverse(BTree t){ stackBTree s; BTree p; s.push(