LeetCode 606. Construct String from Binary Tree （建立一个二叉树的string）

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.

 

 

---

 题目标签：Tree

　　这道题目给了我们一个二叉树，需要我们建立一个二叉树结构的string。并且要省去一些不需要的括号组合。比如一个node只有left，没有right，那么这个right的（）就是不需要的；又或者一个node，既没有左边也没有右边，那么这时候left和right的（）都不需要。

那么就一个点，有4种可能性：

1- 没有left， 也没有right： 直接返回它自己的值；

2- 有left， 也有right： 那么left 和 right 都需要括号，并且把left 和 right recursively 代入function；

3- 没有left， 但有right： 那么left 和 right 都需要括号，并且把right recursively 代入function；

4- 有left， 但没有right： 那么只有left 需要括号， 并且把left recursively 代入function。

 

 

Java Solution:

Runtime beats 53.70% 

完成日期：06/29/2017

关键词：Tree

关键点：分析可能性，利用条件来控制括号

 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution 
{
    public String tree2str(TreeNode t) 
    {
        String res = "";
        
        if(t == null)
            return res;
        
        if(t.left == null && t.right == null)
            return res + t.val;
        
        res += t.val;
        
        // case 1: left is not null, right is not null;
        if(t.left != null && t.right != null)
        {
            // left child
            res += "(" + tree2str(t.left) + ")";
            // right child
            res += "(" + tree2str(t.right) + ")";
        }
        else if(t.left == null && t.right != null) // case 2: left is null, right is not null;
        {
            // left child
            res += "(" + ")";
            // right child
            res += "(" + tree2str(t.right) + ")";
        }
        else if(t.left != null && t.right == null) // case 3: left is not null, right is null;
        {
            // left child
            res += "(" + tree2str(t.left) + ")";
        }
        
            
        return res;
    }
}

参考资料：N/A

 

LeetCode 算法题目列表 - LeetCode Algorithms Questions List