void preordersearch(Tree * t){
if(t == NULL){
return;
}
cout<<t->val<<endl;//先序遍历,根左右
preordersearch(t->left);
preordersearch(t->right);
}
void inorder(Tree *t){ //中序遍历,左中右
if(t==NULL){
return;
}
preordersearch(t->left);
cout<< t->val<<endl;
preordersearch(t->right);
}
void tailorder(Tree *t){//后序遍历,左右中
if (t== NULL){
return ;
}
tailorder(t->left);
tailorder(t->right);
cout<<t->val<<endl;
}