用二叉树实现存储信息

1、#include #include using namespace std;typedef struct _student int id;char20 Name;Int Ageint Math;/(EyN3E);/NEua11Iastruct treeitem struct treeitem *lchild;struct treeitem *rchild;struct _student mystudent;/2E-aiiiaclass Studentpublic:Student(void);Student(void);void Create(struct treeitem *Tnode );/

2、Wvoid Find(struct treeitem *tree,int i);/2ezUpaEQ-nz0Uvoid Search(Student &tree);/2eNUpavoid Change(struct treeitem *Tnode,int i);/斑，A void DeleteNode(struct treeitem *tree,int i);/E初3yStudent *node;/uUpaprivate: bool tj;int i_id,i_age,i_math;char c_ch;=.cpp=Student:Student(void)tj=false;Student:Stu

3、dent(void)void Student:Create(struct treeitem *Tnode)/W 1 cini_id,c_ch,i_age,i_math;if(id!=null&ch!=&age!=null&math!=null)struct _student *Ts;Ts-id=i_id;Ts-Name=c_ch;Ts-Age=i_age;Ts-Math=i_math;Tnode=(struct treeitem*)malloc(sizeof(struct treeitem); Tnode-mystudent=Ts;Create(Tnode-lchild); /Eu3ExoxO

4、E Create(Tnode-rchild); /Eu3E0dx0E coutCreate Complated!endl;elseTnode=NULL; coutNo Create Complated!id=i) tj=true; return;if(tree-lchild!=NULL) if(tree-lchild-id = i) tj=true; return;if(tree-rchild-id = i)tj=true;return;Find(tree-lchild,i);Find(tree-rchild,i);void Student:Search(Student &tree)if(tr

5、ee!NULL)if(tree-lchild-lchild=NULL&tree-lchild-rchild=NULL) return tree-lchild;elseif(tree-rchild-lchild=NULL&tree-rchild-rchild=NULL) return tree-rchild;return Search(tree-lchild);return Search(tree-rchild);void Student:Change(struct treeitem *Tnode-int i)FindTnode-i;if(!tj)coutHt&zEUpajnmystudent.

6、Age=i_age;Tnode-mystudent.Name=c_ch;Tnode-mystudent.Math=i_math;void Student:DeleteNode(struct treeitem *tree,int i) Find(tree,i);if(!tj)coutnI&zEUpa!Hid= i)/daE3ypA0yoAEQiuUpaif(node-lchildNULL & node-rchild = NULL)/dODdibiuUpapACeibdelete node; node=NULL;coutndNE3yupa,pQEtaonlchild ! = NULL & node

7、-rchild = null)/6dx60 x6a6o0 x6 treeitem *p = node;treeitem *d=newtreeitem(Search(node)-id); d-lchild = tree-lchild; d-rchild = NULL; node = d;delete p;coutHIDdptaninpAUpadNE3yrchild != NULL & node-lchild =null)/6d6/x6Ax6*6 treeitem *p = node; treeitem *d=newtreeitem(Search(node)-contents); d-lchild

8、= NULL; d-rchild = tree-rchild;node = d; delete p;coutHIDdptaninpAUpadNE3ynid); d-lchild = tree-lchild; d-child = tree-rchild; node = d;delete p;coutHIDdptaninpAUpadNE3ylchild!=NULL)/2ECiuUpa-E16Dx6x6,CddyECda2eddpAif(tree-lchild-id=i)/E6iuUpapAx6x6ECda2eddpA if(tree-lchild-lchildNULL & tree-lchild-

9、rchild != NULL) treeitem *p = tree-lchild;tree-lchild=tree-lchild-rchild; delete p;coutHIDdptaninpAUpadNE3ylchild-lchild = NULL & tree-lchild-rchild = NULL)delete tree-lchild;tree-lchild = NULL;coutHIDdptaninpAUpadNE3ylchild-rchild = NULL)treeitem *p = tree-lchild;tree-lchild=tree-lchild-lchild;dele

10、te p;coutHIDdptaninpAUpadNE3ynlchild-lchild != NULL & tree-lchild-rchild != NULL) treeitem *p = tree-lchild; treeitem = new treeitem(Search(node)-id);d-left=tree-lchildt-lchild;d-rchild=tree-lchild-rchild; tree-lchild = d; delete p; return; if(tree-rchild!=NULL)/2ECiuUpa-E16D6dox6,CddyECda2eddpA if(

11、tree-rchild-id = i) if(tree-rchild-lchildNULL & tree-rchild-rchild = NULL) delete tree-rchild; tree-rchild = NULL;coutHIDdptaninpAUpadNE3yrchild-lchild != NULL & tree-rchild-rchild = NULL) treeitem *p = tree-rchild;tree-rchild=delete p;coutHIDdptaninpAUpadNE3ynrchild-child = NULL &tree-rchild-rchild != NULL)treeitem *p = tree-rchild;tree-rchild=tree-rchild-rchild;delete p;coutHIDdptaninpAUpadNE3yrchild-lchild != NULL & tree-rchild-rchild != NULL) treeitem *p = tree-rchild; treeitem = new treeitem(Search(