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.

方法思路

public class Solution {
    //Runtime: 10 ms, faster than 79.90%
    //Memory Usage: 40.4 MB, less than 47.41%
    public String tree2str(TreeNode t) {
        if (t == null) return "";
        
        String result = t.val + "";
        
        String left = tree2str(t.left);
        String right = tree2str(t.right);
        
        if (left == "" && right == "") 
            return result;
        if (left == "") 
            return result + "()" + "(" + right + ")";
        if (right == "") 
            return result + "(" + left + ")";
        
        return result + "(" + left + ")" + "(" + right + ")";
    }
}