二叉树非递归实现

//<span style="font-family: Arial, Helvetica, sans-serif;">FBinTree.h</span>

#pragma once#include<iostream>using namespace std;#include<stack>template<class Type>class BinTree;template<class Type>class BinTreeNode;typedef enum{L,R}Tag_Type;template<class Type>struct Node{Tag_Type  Falg;BinTreeNode<Type> *Newptr;};template<class Type>class BinTreeNode{friend class BinTree<Type>;private:Type data;BinTreeNode<Type> *leftChild;BinTreeNode<Type> *rightChild;public:BinTreeNode():data(Type()),leftChild(NULL),rightChild(NULL){}BinTreeNode(const Type &d,BinTreeNode<Type> *left=NULL,BinTreeNode<Type> *right=NULL):data(d),leftChild(left),rightChild(right){}};template<class Type>class BinTree{private:Type value;BinTreeNode<Type>*root;protected:void CreateBinTree(BinTreeNode<Type> *&t,const char *&str){if(*str==value)t=NULL;else{t=new BinTreeNode<Type> (*str);CreateBinTree(t->leftChild,++str);CreateBinTree(t->rightChild,++str);}}void PreOrder(BinTreeNode<Type> *t)//前序遍历{if(t==NULL)return;stack<BinTreeNode<Type>* > r;BinTreeNode<Type> *p;r.push(t);while(!r.empty()){p=r.top();r.pop();cout<<p->data<<" ";if(p->rightChild !=NULL)r.push(p->rightChild);if(p->leftChild !=NULL)r.push(p->leftChild);}}void InOrder(BinTreeNode<Type> *t)//中序遍历{if(t==NULL)return;stack<BinTreeNode<Type> *> r;BinTreeNode<Type> *p;r.push(t);while(!r.empty()){while(t->leftChild !=NULL){r.push(t->leftChild);t=t->leftChild;}p=r.top();r.pop();cout<<p->data<<" ";if(p->rightChild !=NULL){t=p->rightChild;r.push(t);}}}void PostOrder(BinTreeNode<Type> *t)//后序遍历{if(t==NULL)return;stack<struct Node<Type> > r;struct Node<Type> Node;Node.Newptr=t;Node.Falg=L;r.push(Node);while(!r.empty()){while(t->leftChild !=NULL){Node.Newptr=t->leftChild;Node.Falg=L;r.push(Node);t=t->leftChild;}bool falg=true;while(falg && !r.empty()){Node=r.top();r.pop();switch(Node.Falg){case L:Node.Falg=R;falg=false;t=Node.Newptr;r.push(Node);break;case R:cout<<Node.Newptr->data<<" ";break;}if(t->rightChild==NULL){Node.Falg=R;falg=true;}}if(t->rightChild !=NULL){Node.Newptr=t->rightChild;Node.Falg=L;r.push(Node);t=t->rightChild;}}}void CreatBinTree_Pre(BinTreeNode<Type> *&t,const char *VLR,const char *LVR,int n){if(0==n)return;int k=0;             //A B D E F C G  -->VLRwhile(*VLR != LVR[k])//D B F E A C G  -->LVRk++;t=new BinTreeNode<Type> (*VLR);CreatBinTree_Pre(t->leftChild,VLR+1,LVR,k);CreatBinTree_Pre(t->rightChild,VLR+k+1,LVR+k+1,n-k-1);}void CreatBinTree_Post(BinTreeNode<Type> *&t,const char *LVR,const char *LRV,int n){if(n==0)return; //D B F E A C G  LVR 中int k=0;   // D F E B G C A  LRV 后while(LRV[n-1] !=LVR[k])k++;t=new BinTreeNode<Type> (LRV[n-1]);CreatBinTree_Post(t->leftChild,LVR,LRV,k);CreatBinTree_Post(t->rightChild,LVR+k+1,LRV+n-1,n-k-1);}public:void CreatBinTree_Post(const char *LVR,const char *LRV,int n){CreatBinTree_Post(root,LVR,LRV,n);}void CreatBinTree_Pre(const char *VLR,const char *LVR,int n){CreatBinTree_Pre(root,VLR,LVR,n);}void PreOrder()//前序遍历{PreOrder(root);}void InOrder()//中序遍历{InOrder(root);}void PostOrder()//后序遍历{PostOrder(root);}BinTree():value(Type()),root(NULL){}BinTree(const Type &v):value(v),root(NULL){}void CreateBinTree(const char *str){CreateBinTree(root, str);}};

#include"FBinTree.h"//DBFEACG  DFEBGCAvoid main(){char *str="DBFEACG";//中序char *Rstr="DFEBGCA";//后序int length=strlen(str);BinTree<char> Tree;Tree.CreatBinTree_Post(str,Rstr,length);cout<<"\n前序：";Tree.PreOrder();cout<<"\n中序：";Tree.InOrder();cout<<"\n后序：";Tree.PostOrder();cout<<endl;}/*void main(){//char *str="abde##f##kL##n##cxy##m##t##";//char *str="ABD##EF###C#G##";char *str="abd##e##cf##g##";BinTree<char> Tree('#');Tree.CreateBinTree(str);cout<<"\n前序：";Tree.PreOrder();cout<<"\n中序：";Tree.InOrder();cout<<"\n后序：";Tree.PostOrder();cout<<endl;}/*void main(){char *str="ABDEFCG";char *Rstr="DBFEACG";int length=strlen(str);BinTree<char> Tree;Tree.CreatBinTree_Pre(str,Rstr,length);cout<<"\n前序：";Tree.PreOrder();cout<<"\n中序：";Tree.InOrder();cout<<"\n后序：";Tree.PostOrder();cout<<endl;}/*void main(){//char *str="abde##f##kL##n##cxy##m##t##";char *str="abd##e##cf##g##";BinTree<char> Tree('#');Tree.CreateBinTree(str);cout<<"\n前序：";Tree.PreOrder();cout<<"\n中序：";Tree.InOrder();cout<<"\n后序：";Tree.PostOrder();cout<<endl;}*/