> For the complete documentation index, see [llms.txt](https://protegejj.gitbook.io/algorithm-practice/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://protegejj.gitbook.io/algorithm-practice/leetcode/tree/606-construct-string-from-binary-tree.md).

# 606 Construct String from Binary Tree

## 606. Construct String from Binary Tree

## 1. Question

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. Implementation

**(1) Recursion**

思路：直接preorder traversal就好，注意如果右子树是空的时候，不需要加"()"，这样并不影响1-1对应的关系

```java
class Solution {
    public String tree2str(TreeNode t) {
        if (t == null) {
            return "";
        }

        String res = t.val + "";

        String left = tree2str(t.left);
        String right = tree2str(t.right);

        if (left == "" && right == "") {
            return res;
        }
        else if (left == "") {
            return res + "()" + "(" + right + ")";
        }
        else if (right == "") {
            return res + "(" + left + ")";
        }
        else {
            return res + "(" + left + ")" + "(" + right + ")";
        }
    }
}
```

## 3. Time & Space Complexity

**Recursion**: 时间复杂度O(n), 空间复杂度O(h)


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://protegejj.gitbook.io/algorithm-practice/leetcode/tree/606-construct-string-from-binary-tree.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.