1、實驗六二叉樹#in clude#in cludetypedef char ElemType;struct BTreeNodeElemType data;BTreeNode *left;BTreeNode *righ t;void lnitBTree(BTreeNode* & BT)BT=NULL;void CreateBTree(BTreeNode* & BT,char *a) const int MaxSize=50;BTreeNode*sMaxSize;int top=-1;BT=NULL;BTreeNode*p;int k;int i=0;while (ai)switch(ai)case

2、 :break;case (:if (top=MaxSize-1) coutvve ndl; exit(1);top+;stop=p;k=1;break;case ):if(top=-1)coutvvdata=ai; p-left=p-right=NULL; if(BT=NULL)BT=p;elseif(k=1) stop-left=p;else stop-right=p;i+;bool Fi ndBTree(BTreeNode*BT,ElemType &x) if(BT=NULL)return false;elseif(BT-data=x)x=BT-data;return true;else

3、if(F in dBTree(BT-left,x)return true;if(F in dBTree(BT-right,x)return true;return false;int DepthTree(BTreeNode*BT)if(BT=NULL)return 0;elseint dep仁 DepthTree(BT-left); int dep2=DepthTree(BT-right); if(dep1dep2) retur n dep1+1;elseretur n dep2+1;bool EmptyBTree(BTreeNode*BT)return BT=NULL;void PrintB

4、Tree(BTreeNode*BT)if(BT=NULL)coutdata;if(BT-left!=NULL | BT-right匸NULL) coutleft);if(BT-right!=NULL)coutvv,：Prin tBTree(BT-right); cout);void LevelOrder(BTreeNode*BT)const int MaxSize=30;BTreeNode*qMaxSize;int fron t=0;int rear=0;BTreeNode*p;if(BT=NULL)rear=(rear+1)%MaxSize;qrear=BT;while(fro nt!=re

5、ar)fron t=(fro nt+1)%MaxSize; p=qfro nt;coutdataleft!=NULL)rear=(rea 葉1)%MaxSize; qrear=p-left;if(p-right!=NULL)rear=(rea 葉1)%MaxSize; qrear=p-righ t;void ClearBTree(BTreeNode*&BT) if(BT!=NULL)ClearBTree(BT-left);ClearBTree(BT-right);delete BT;BT=NULL;void mai n()BTreeNode*bt;In itBTree(bt);char b50;cout輸入二叉樹用廣義表表示的字符串:e ndl;cin. getl in e(b,sizeof(b);CreateBTree(bt,b);Prin tBTree(bt);coute ndl;cout按層：；LevelOrder(bt);coute ndl;ElemType x;cout x;if(Fi ndBTree(bt,x)cout查找字符x