二叉树链表存储结构

#include<iostream>
using namespace std;


struct binode
{char data;
binode *lchild,*rchild;
};


class tree
{


public:
tree(){root=creat(root);}
~tree(){release(root);}
void preorder()
{preorder(root);}
void inorder()
{inorder(root);}
void postorder()
{postorder(root);}


private:
binode *root;
binode *creat(binode *bt);
void release(binode *bt);
void preorder(binode *bt);
void inorder(binode *bt);
void postorder(binode *bt);
};




binode *tree::creat(binode *bt)
{char ch;
cin>>ch;
if(ch=='#')return NULL;
else 
{bt=new binode;
bt->data=ch;
bt->lchild=creat(bt->lchild);
bt->rchild=creat(bt->rchild);
}
return bt;}


void tree::release(binode *bt)
{if(bt!=NULL)    
{
release(bt->lchild);
release(bt->rchild);
delete bt;
}
}




void tree::preorder (binode *bt)
{if(bt==NULL)  
return;
else 
{cout<<bt->data<<" ";
preorder(bt->lchild);
preorder(bt->rchild);
}
}


void tree::inorder(binode *bt)
{if(bt==NULL)  
return ;
else 
{inorder(bt->lchild);
cout<<bt->data<<" ";
inorder(bt->rchild);
}
}
void tree::postorder(binode *bt)
{if(bt==NULL)return ;    
else
{postorder(bt->lchild);
postorder(bt->rchild);
cout<<bt->data<<" ";
}
}
int main()
{
cout<<"请创建一棵二叉树,以'#'为空格:"<<endl;
tree T;
cout<<"**********前序遍历**********"<<endl;
T.preorder();
cout<<endl;
cout<<"**********中序遍历**********"<<endl;
T.inorder();
cout<<endl;
cout<<"**********后序遍历**********"<<endl;
T.postorder();
cout<<endl;

return 0;}