void BiTreeToExp(BiTree *T, int deep){
if(!T){
return ;
}
else if(!T->lchild && !T->rchild){
print(T->data);
}else{
if(deep>1){ //不为叶子结点,则运算次序需要加括号
printf("(");
}
BiTreeToExp(T->lchild,deep+1); //往下一层,deep+1
print(T->data);
BiTree(T->rchild,deep+1);
if(deep>1){
printf(")");
}
}
}