数据结构二叉树

《数据结构二叉树》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、#include//#include"mystring.h"#include//#include//二叉链表结点的类定义usingnamespacestd;templateclassbinarytreenode{//friendclassbinarytree;private:Tinfo;binarytreenode*left;binarytreenode*right;public://binarytreenode()binarytreenode(Tele){info=ele;left

2、=NULL;right=NULL;}binarytreenode(Tele,binarytreenode*l,binarytreenode*r){info=ele;left=l;right=r;}Tvalue()const;binarytreenode*leftchild()const;binarytreenode*rightchild()const;voidsetleftchild(binarytreenode*l);voidsetrightchild(binarytreenode*l);voidsetvalue(Tval);};/*te

3、mplatebinarytreenode::binarytreenode(){left=null;right=null;}templatebinarytreenode::binarytreenode(Tele){info=ele;left=NULL;right=NULL;}templatebinarytreenode::binarytreenode(Tele,binarytreenode*l,binarytreenode*r){info=ele;left=l;right=r;}*/templateTb

4、inarytreenode::value()const{returninfo;}templatebinarytreenode*binarytreenode::leftchild()const{returnleft;}templatebinarytreenode*binarytreenode::rightchild()const{returnright;}templatevoidbinarytreenode::setleftchild(binarytreenode*l){left=l;}t

5、emplatevoidbinarytreenode::setrightchild(binarytreenode*r){right=r;}templatevoidbinarytreenode::setvalue(Tval){info=val;}//二叉链表的类定义templateclassbinarytree{private:binarytreenode*root;public:binarytree(){root=NULL;}~binarytree(){deletebinarytree(root);}bin

6、arytreenode*Root(){returnroot;}binarytreenode*parent(binarytreenode*current);binarytreenode*leftsibling(binarytreenode*current);binarytreenode*rightsibling(binarytreenode*current);voidcreattree(Tinfo);voidcreattree(Tinfo,binarytree&lefttree,binarytree&righttree);/

7、/voidcreattree(mystringa);voiddeletebinarytree(binarytreenode*root);voidpreorder1(binarytreenode*root);//保存当前结点的前序周游voidpreorder(binarytreenode*root);//保存当前结点右孩子的前序周游voidinorder(binarytreenode*root);voidpostorder(binarytreenode*root)