序穿线二叉树.docVIP

#includeiostream using namespace std; templateclass T struct TBtnode { T d; int lflag; int rflag; TBtnode *lchild; TBrnode *rchild; }; templateclass T class InTBinaryTree { private: TBtnodeT *BT; public: InTBinaryTree() {BT=NULL;return;} void CreateBinaryTree(T); void CreateInTBinaryTree(); void InTTree(); }; templateclass T void InTBinaryTreeT::CreateBinaryTree(T end) { TBtnodeT *p; T x; cinx; if(x==end) return; p=new TBtnodeT; p-d=x;p-lchild=NULL;p-rchild=NULL;p-lflag=0;p-rflag=0; BT=p; Create(p,1,end); Create(p,2,end); return; } templateclass T static Create