【Leetcode】606. Construct String from Binary Tree（Easy）

1.题目

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.

2.思路

先序遍历，先访问当前结点，然后访问左孩子，右孩子。当孩子不空的时候，为孩子的返回值，廓上括号。特别地，当左孩子是空的，而右孩子不空的时候，左孩子的括号无法省略，否则会破坏一一对应的关系。

3.算法

class Solution {
    public String tree2str(TreeNode t) {
        StringBuilder res=new StringBuilder();
        if(t==null){
            return "";
        }
        res.append(""+t.val);
        
        String left=tree2str(t.left);
        String right=tree2str(t.right);
        
        if(!left.equals("")){
            if(right.equals(""))res.append("(").append(left).append(")").append(right);
            else res.append("(").append(left).append(")").append("(").append(right).append(")");
        }
        else{
            if(right.equals(""))res.append(left).append(right);
            else res.append("(").append(left).append(")").append("(").append(right).append(")");
        }   
       return res.toString();
    }
}

4.总结

StringBuilder.append("").append(string)的速度要比StringBuilder.append(""+string)快。