606. Construct String from Binary Tree

You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way.

The null node needs to be represented by empty parenthesis pair “()”. And you need to omit all the empty parenthesis pairs that don’t affect the one-to-one mapping relationship between the string and the original binary tree.

Example 1:

Input: Binary tree: [1,2,3,4]
       1
     /   \
    2     3
   /    
  4     

Output: "1(2(4))(3)"

Explanation: Originallay it needs to be “1(2(4)())(3()())”,
but you need to omit all the unnecessary empty parenthesis pairs.
And it will be “1(2(4))(3)”.
Example 2:

Input: Binary tree: [1,2,3,null,4]
       1
     /   \
    2     3
     \  
      4 

Output: "1(2()(4))(3)"

Explanation: Almost the same as the first example,
except we can’t omit the first parenthesis pair to break the one-to-one mapping relationship between the input and the output.

以前序遍历的方式组合成字符串
这个题还是比较好的，比一般的简单题要稍难一点
奈何解题的过程碰到了一些问题
如题意没仔细解读，另外就是开始使用了一个全局StringBuffer导致了leetcode的bug，在runcode里是正确的答案submit时候就出错了

思路:
前序遍历每一个节点
如果存在左右节点先加一个”(“再遍历左右节点然后加一个”)”

特殊情况:如果左节点不存在但右节点存在则需要额外添加一个()

递归构造字符串

public StringBuffer  tree2str(StringBuffer tree2strSb,TreeNode t, boolean isLeft,int rightNums) {

        //当前为空
        if (t == null) {

            return tree2strSb;
        }
        int val = t.val;
        //先把当前节点添加到字符串中
        tree2strSb.append(val);
        //如果左右节点都为空

        //左节点不为空
        if (t.left != null) {
            //添加左括号
            tree2strSb.append("(");
             tree2strSb = tree2str(tree2strSb,t.left, true, rightNums + 1);
             tree2strSb.append(")");
        }else  if(t.right != null )tree2strSb.append("()");
        //右节点不为空
        if (t.right != null) {
            //添加左括号
            tree2strSb.append("(");

            tree2strSb = tree2str(tree2strSb,t.right, false, rightNums + 1);
            tree2strSb.append(")");
        }
        return tree2strSb;

    }