606. Construct String from Binary Tree
Posted Premiumlab
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了606. Construct String from Binary Tree相关的知识,希望对你有一定的参考价值。
https://leetcode.com/problems/construct-string-from-binary-tree/#/description
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.
# 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 """ # recursion def preorder(root): if root is None: return "" s = str(root.val) left = preorder(root.left) right = preorder(root.right) if right == "" and left =="": return s elif left == "": s += "()" + "(" + right + ")" elif right == "": s += "(" + left + ")" else: s += "(" + left + ")" + "(" + right + ")" return s return preorder(t)
以上是关于606. Construct String from Binary Tree的主要内容,如果未能解决你的问题,请参考以下文章
606. Construct String from Binary Tree easy
606. Construct String from Binary Tree
606. Construct String from Binary Tree
606. Construct String from Binary Tree