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.

Complexity Analysis

Time complexity : O(n)O(n). nn nodes are pushed and popped in a stack.

Space complexity : O(n)O(n). stackstack size can grow upto nn.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public String tree2str(TreeNode t) {
        if(t == null) return "";
        
        Stack<TreeNode> stack = new Stack();
        
        Set<TreeNode> set = new HashSet<>();
        
        stack.push(t);
        StringBuilder sb = new StringBuilder();
        while(!stack.isEmpty()){
            t = stack.peek();
            if(set.contains(t)){
                sb.append(")");
                stack.pop();
            }else{
                sb.append("("+t.val);
                set.add(t);
                
                if(t.left == null && t.right != null){
                    sb.append("()");
                }
                
                if(t.right != null) stack.push(t.right);
                if(t.left != null) stack.push(t.left);
            }
        }
            return sb.substring(1,sb.length()-1);
    }
}