完整二叉树实例程序

包含二叉树的顺序存储，插入，删除结点，以及设置root结点，和前序、中序、后序、按层次遍历的完成代码。

#include<iostream>#include<stdio.h>#include<stdlib.h>#define QUEUE_MAXSIZE 50using namespace std;typedef struct CTree{char data;struct CTree *left;struct CTree *right;}CBTree;CBTree *BTreeInit(CBTree *node){if(node != NULL)return node;elsereturn NULL;}int BTreeAddNode(CBTree *bt,CBTree *node,int n) {if(bt==NULL){cout<<"no parent!"<<endl;return 0;}switch(n){case 1:if(bt->left){cout<<"the left is existing."<<endl;return 0;}elsebt->left=node;break;case 2:if(bt->right){cout<<"the right is existing."<<endl;return 0;}elsebt->right=node;break;default:cout<<"it's wrong!"<<endl;return 0;}return 1;}CBTree *BTreeLeft(CBTree *bt) {if(bt)return bt->left;elsereturn NULL;}CBTree *BTreeright(CBTree *bt){if(bt)return bt->right;elsereturn NULL;}int BTreeIsempty(CBTree *bt) {if(bt)return 0;elsereturn 1;}int BTreeDepth(CBTree *bt) {int dep1,dep2;if(bt==NULL)return 0;else{dep1=BTreeDepth(bt->left);dep2=BTreeDepth(bt->right);if(dep1>dep2)return dep1+1;elsereturn dep2+1;}}CBTree *BTreeFind(CBTree *bt,char data) {CBTree *p;if(bt==NULL)return NULL;else{if(bt->data == data)return bt;else{if(p=BTreeFind(bt->left,data))return p;else if(p=BTreeFind(bt->right,data))return p;elsereturn NULL;}}}void BTreeClear(CBTree *bt){if(bt){BTreeClear(bt->left);BTreeClear(bt->right);free(bt);bt=NULL;}return;}void BTree_pre(CBTree *bt){{cout<<bt->data<<" ";BTree_pre(bt->left);BTree_pre(bt->right);}return;}void BTree_mid(CBTree *bt) {if(bt){BTree_mid(bt->left);cout<<bt->data<<" ";BTree_mid(bt->right);}return;}void BTree_post(CBTree *bt) {{BTree_post(bt->left);BTree_post(bt->right);cout<<bt->data<<" ";}return;}void BTree_level(CBTree *bt){CBTree *p,*q[QUEUE_MAXSIZE];int head=0,tail=0;if(bt){tail=(tail+1)%QUEUE_MAXSIZE;q[tail]=bt;}while(head != tail){head=(head+1)%QUEUE_MAXSIZE;p=q[head];cout<<p->data<<" ";if(p->left != NULL){tail=(tail+1)%QUEUE_MAXSIZE;q[tail]=p->left;}if(p->right != NULL){tail=(tail+1)%QUEUE_MAXSIZE;q[tail]=p->right;}}return;}CBTree *InitRoot(){CBTree *node;if(node=(CBTree *)malloc(sizeof(CBTree))) {cout<<"input the root: ";cin>>node->data;node->left=NULL;node->right=NULL;return node;}return NULL;}void AddNode(CBTree *bt){CBTree *node,*parent;char data,select;if(node= (CBTree *)malloc(sizeof(CBTree))) {cout<<"please input the data: ";cin>>node->data;node->left=NULL;node->right=NULL;cout<<"please input the parent: ";cin>>data;parent=BTreeFind(bt,data);if(! parent){cout<<"no parent."<<endl;free(node);return;}cout<<"1.to left; 2.to right";do{cin>>select;select=select-'0';if(select==1 || select==2)BTreeAddNode(parent,node,select);} while (select!=1 && select !=2);}return;}主函数调用为：int main(){CBTree *root=NULL;char select;do{cout<<"1.set root 2.add node 3.pre_scan"<<endl;cout<<"4.min_scan 5.post_scan 6.level_scan"<<endl; cout<<"7.the depth 0.exit"<<endl;cin>>select;switch(select){case'1':root=InitRoot();break;case'2':AddNode(root);break;case'3':cout<<"the pre_scan is:";BTree_pre(root);cout<<endl;break;case'4':cout<<"the mid_scan is:";BTree_mid(root);cout<<endl;break;case'5':cout<<"the post_scan is:";BTree_post(root);cout<<endl;break;case'6':cout<<"the level_scan is:";BTree_level(root);cout<<endl;break;case'7':cout<<"the depth is "<<BTreeDepth(root)<<endl;break;case'0':break;}} while (select !='0');BTreeClear(root);root=NULL;return 0;}实例程序：。