//任务:将给定表达式二叉树转换为等价中缀表达式输出
//算法思想:在遍历左子树之前加左括号,遍历完左子树后输出中间结点,在遍历右子树之后加右括号
void InOrder(BiTree2& T,int deep)
{
if (T == NULL)
return;
else if (T->lchild == NULL && T->rchild == NULL)
cout << T->data;
else {
if (deep > 1) cout << "(";
InOrder(T->lchild, deep + 1);
cout << T->data;
InOrder(T->rchild, deep + 1);
if (deep > 1) cout << ")";
}
}