实验六二叉树

1、实验六二叉树#include<iostream.h>#include<stdlib.h>typedef char ElemType;struct BTreeNode(Elemiype data;BTreeNodeBTreeNode bright;);void InitBTree(BTreeNode*& BT)(BT=NULL;)void CreateBTree(BTreeNodeHc& BT,char *a) (const int MaxSize=50;BTreeNodesMaxSize;int top=-l;BT=NULL;BTreeNodep;int

2、 k;int i=0;switch(ai)(case 'break;caseif (top=MaxSize-l)(cout«HU«endl; exit(l);)top+;stop=p;k=l;break;caseif(top=-l)(cout«HU«endl; exit(l);top-;break;case 'J:k=2;break;default:p=new BTreeNode;p->data=ai;p->left=p->right=NULL;if(BT=NULL)BT=p;else(if(k=l)stop->l

3、eft=p;elsestop->right=p;)i+；)bool FindBTree(BTreeNode：5cBT,Elemriype&x)(if(BT=NULL)return false;else(if(BT->data=x)(x=BT->data;return true;) else (if(FindBTree(BT->left,x)return true;if(FindBTree(BT->right9x)return true;return false;)int DepthTree(BTreeNode*BT)if(BT=NULL)return 0;

4、else(int depl=DepthTree(BT->left);int dep2=DepthTree(BT->right);if(depl>dep2)return depl+1;elsereturn dep2+l;)bool EmptyBTree(BTreeNode*BT)(return BT=NULL;)void PrintBTree(BTreeNode*BT)(if(BT=NULL)cout«BT->data;if(BT->left!=NULL II BT->right!=NULL) (cout«T(f;PrintBTree(BT

5、->left);if(BT->right!=NULL)cout«f/;PrintBTree(BT->right);coutvv')')void LevelOrder(BTreeNode*BT)(const int MaxSize=30;BTreeNodeqMaxSize;int front=0;int rear=0;BTreeNodep;if(BT=NULL)(rear=(rear+1)% MaxSize;qrear=BT;)while(front!=rear)front=(front+l) %MaxSize;p=q front;cout«

6、p->data«T if(p->left!=NULL) (rear=(rear+l) %MaxSize; qrear=p->left;)if(p->right!=NULL)(rear=(rear+l)%MaxSize; qrear=p->right;)void ClearBTree(BTreeNode*&BT) (if(BT!=NULL)ClearBTree(BT->left);ClearBTree(BT->right);delete BT;BT=NULL;)void main()(BTreeNodebt;InitBTree(bt);char b50;coutc”输入二叉树用广义表表示的字符串: n«endl;cin.getline(b9sizeof(b);CreateBTree(bt,b);PrintBTree(bt);cout«endl;coutvv”按层：”;LevelOrder(bt);cout«endl;Elemiype x;coutcc”输入一个待查字符：”；cin»x;if(FindBTree(bt,x)coutvv”查找字符"vvxvv”成功! n«end