类实现二叉树，main函数怎么写

Question

#include
using namespace std;

typedef struct shu
{char data;
struct shu*lson,*rson;
}snode,*prt;

class tree
{

prt inpront(prt root);
void qianxu(prt root);
void zhongxu(prt root);
void houxu(prt root);

};
#include"SHU.h"prt tree::inpront(prt root){ char ch=0; cin>>ch; if(ch=='#')return NULL; else { root=new snode; root->data=ch; root->lson=inpront(root->lson); root->rson=inpront(root->rson); } return root;};void tree::qianxu(prt root){ if(root!=NULL); { cout<<" "<data; qianxu(root->lson); qianxu(root->rson); }};void tree::zhongxu(prt root){ if(root!=NULL); { zhongxu(root->lson); cout<<" "<data; zhongxu(root->rson); }};void tree::houxu(prt root){ if(root!=NULL); { houxu(root->lson); houxu(root->rson); cout<<" "<data; }};

Answer 1

先构造二叉树，然后调用qianxu zhongxu houxu等方法， 传入你的根节点