用二叉树实现存储信息

1、用二叉树实现存储信息用二叉树实现存储信息.txt老子忽悠孩子叫教育，孩子忽悠老子叫欺骗，互相忽悠叫代沟。男人这花花世界，我要用什么颜色来吸引你。#include<iostream>#include<stdlib.h>usingnamespacestd;typedefstruct_studentintid;char20Name;IntAge;intMath;/（数学成绩）;/学生结构体structtreeitemstructtreeitem*lchild;structtreeitem*rchild;struct_studentmystudent;/二叉树结构体classS

2、tudentpublic:Student(void);Student(void);voidCreate(structtreeitem*Tnode);/创建voidFind(structtreeitem*tree,inti);查看节点是否存在voidSearch(Student&tree);/查询节点voidChange(structtreeitem*Tnode,inti);/修改voidDeleteNode(structtreeitem*tree,inti);/删除Student*node;/根节点private:booltj;inti_id,i_age,i_math;charc_ch

3、;=.cpp=Student:Student(void)(tj=false;)Student:Student(void)()voidStudent:Create(structtreeitem*Tnode)/创建1(cin>>i_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=imath;Tn

4、ode=(structtreeitem*)malloc(sizeof(structtreeitem);Tnode->mystudent=Ts;Create(Tnode->lchild);/生成左子树Create(Tnode->rchild);/生成右子树cout<<"CreateComplated!"<<endl;elseTnode=NULL;cout<<"NoCreateComplated!"<<endl;voidBinSTree:Find(structtreeitem*tree,int

5、i)/查找if(tree!=NULL)if(tree->id=i)tj=true;return;if(tree->lchild!=NULL)f(tree->lchild->id=i)tj=true;return;if(tree->rchild!=NULL)f(tree->rchild->id=i)tj=true;return;Find(tree->lchild,i);Find(tree->rchild,i);voidStudent:Search(Student&tree)if(tree!NULL)if(tree->lchild

6、->lchild=NULL&&tree->lchild->rchild=NULL)returntree->lchild;elsef(tree->rchild->lchild=NULL&&tree->rchid->rchild=NULL)returntree->rchild;returnSearch(tree->lchild);returnSearch(tree->rchild);voidStudent二Change(structtreeitem*Tnode,inti)Find(Tnode,i);i

7、f(!tj)cout<<"无止匕节点！"<<endl;elsecin>>i_age,i_math,c_ch;Tnode->mystudent.Age=i_age;Tnode->mystudent.Name=c_ch;Tnode->mystudent.Math=i_math;voidStudent:DeleteNode(structtreeitem*tree,inti)Find(tree,i);if(!tj)cout<<"无止匕节点!"<<endl;return;if(tree!

8、=NULL)if(node->id=i)/要删除的正好是根节点f(node->lchild=NULL&&node->rchild=NULL)/只有一个根节点的情况deletenode;node=NULL;cout<<"已删除节点,当前树为空"<<endl;return;elseif(node->lchild!=NULL&&node->rchild=NULL)/有左孩子没右孩子newtreeitem*p=node;treeitem*dtreeitem(Search(node)->id)

9、;d->lchild=tree->lchild;d->rchild=NULL;node=d;deletep;cout<<"ID值为"<<i<<"的节点已被删除"<<endl;elseif(node->rchild!=NULL&&node->lchild=NULL)/有右孩子没左孩子treeitem*p=node;treeitem*d=newtreeitem(Search(node)->contents);d->lchild=NULL;d->rc

10、hild=tree->rchild;d;node =deletep;cout<<"ID值为"<<i<<"的节点已被删除"<<endl;else/有左、右孩子newtreeitem*p=node;treeitem*dtreeitem(Search(node)->id);d->lchild=tree->lchild;d->child=tree->rchild;node=d;deletep;cout<<"ID值为"<<i<<

11、;"的节点已被删除"<<endl;if(tree->lchild!=NULL)/左孩子，且正是要查找的if(tree->lchild->id=i)/子是要查找的if(tree->lchild->lchildtree->lchild->rchild!=NULL)treeitem*p=tree->lchild;不是根节点，树还有若根节点的左孩=NULL&&tree->lchild=tree->lchild->rchild;deletep;cout<<"ID值为&q

12、uot;<<i<<"的节点已被删除"<<endl;)elsef(tree->lchild->lchild=NULL&&tree->lchild->rchild=NULL)deletetree->lchild;tree->lchild=NULL;cout<<"ID值为"<<i<<"的节点已被删除'<<endl;)elsef(tree->lchild->lchild!=NULL&&

13、;tree->lchild->rchild=NULL)treeitem*p=tree->lchild;tree->lchild=tree->lchild->lchild;deletep;cout<<"ID值为"<<i<<"的节点已被删除"<<endl;elseif(tree->lchild->lchild!=NULL&&tree->lchild->rchild!=NULL)treeitem*p=tree->lchild;tre

14、eitem*d=newtreeitem(Search(node)->id);d->left=tree->lchildt->lchild;d->rchild=tree->lchild->rchild;tree->lchild = d;deletep;return;f(tree->rchild!=NULL)右孩子,且正是要查找的不是根节点，树还有NULL &&f(tree->rchild->id=i)f(tree->rchild->lchildtree->rchild->rchild=NULL

15、)deletetree->rchild;tree->rchild=NULL;cout<<"ID值为"<<i<<"的节点已被删除'<<endl;)elsef(tree->rchild->lchild!=NULL&&tree->rchild->rchild=NULL)treeitem*p=tree->rchild;tree->rchild=tree->rchild->lchild;deletep;cout<<"ID值

16、为"<<i<<"的节点已被删除'<<endl;)elseif(tree->rchild->child=NULL&&tree->rchild->rchild!=NULL)treeitem*p=tree->rchild;tree->rchild=tree->rchild->rchild;deletep;cout<<"ID值为"<<i<<"的节点已被删除"<<endl;elseif(tree->rchild->lchild!=NULL&&tree->rchild->rchild!=NULL)treei