将二叉树转换为等价的中缀表达式

---

IMG_20180915_111617.jpg

void Inorder(Node*root,int deep){
  if(root==NULL)return;
  else if(!root->left&&!root->right){
    cout<<root->value;
  }
  else{
    if(deep>1){
      cout<<"(";
    }
    Inorder(root->left,deep+1);
    cout<<root->value;
    Inorder(root->right,deep+1);
    if(deep>1){
      cout<<")";
    }
  }
}
Inorder(root,1);