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.
Python Solution 1:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def tree2str(self, t):
"""
:type t: TreeNode
:rtype: str
"""
def t2str(t, res):
if not t: return
res.append(str(t.val))
if not t.left and not t.right: return
res.append('(')
t2str(t.left, res)
res.append(')')
if t.right:
res.append('(')
t2str(t.right, res)
res.append(')')
res = []
t2str(t, res)
return "".join(res)
Python Solution 2:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def tree2str(self, t):
"""
:type t: TreeNode
:rtype: str
"""
if not t: return ""
if not t.left and not t.right:
return str(t.val)
res = [str(t.val)]
res.append('(')
res.append(self.tree2str(t.left))
res.append(')')
if t.right:
res.append('(')
res.append(self.tree2str(t.right))
res.append(')')
return "".join(res)
Summary:
- both is beautful, I prefer the solution 1.
LeetCode: 606. Construct String from Binary Tree
近期评论