Package g0601_0700.s0606_construct_string_from_binary_tree

Class Solution

java.lang.Object

g0601_0700.s0606_construct_string_from_binary_tree.Solution

public class Solution
extends Object

606 - Construct String from Binary Tree.<p>Easy</p> <p>Given the <code>root</code> of a binary tree, construct a string consisting of parenthesis and integers from a binary tree with the preorder traversal way, and return it.</p> <p>Omit all the empty parenthesis pairs that do not affect the one-to-one mapping relationship between the string and the original binary tree.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/05/03/cons1-tree.jpg" alt="" /></p> <p><strong>Input:</strong> root = [1,2,3,4]</p> <p><strong>Output:</strong> &ldquo;1(2(4))(3)&rdquo;</p> <p><strong>Explanation:</strong> Originally, it needs to be &ldquo;1(2(4)())(3()())&rdquo;, but you need to omit all the unnecessary empty parenthesis pairs. And it will be &ldquo;1(2(4))(3)&rdquo;</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/05/03/cons2-tree.jpg" alt="" /></p> <p><strong>Input:</strong> root = [1,2,3,null,4]</p> <p><strong>Output:</strong> &ldquo;1(2()(4))(3)&rdquo;</p> <p><strong>Explanation:</strong> Almost the same as the first example, except we cannot omit the first parenthesis pair to break the one-to-one mapping relationship between the input and the output.</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in the tree is in the range <code>[1, 10⁴]</code>.</li> <li><code>-1000 <= Node.val <= 1000</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
String	tree2str(TreeNode t)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

tree2str

public String tree2str(TreeNode t)