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 out

题目含义：将二叉树序列化为字符串，形式为"root(left)(right)"，空节点表示为"()"。所有不产生歧义的空括号可以省去。

 1     public String tree2str(TreeNode t) {
 2          if (t == null) return "";
 3         
 4         String result = t.val + "";
 5         
 6         String left = tree2str(t.left);
 7         String right = tree2str(t.right);
 8         
 9         if (left == "" && right == "") return result;
10         if (left == "") return result + "()" + "(" + right + ")";
11         if (right == "") return result + "(" + left + ")";
12         return result + "(" + left + ")" + "(" + right + ")";       
13     }

 

转载于:https://www.cnblogs.com/wzj4858/p/7682170.html