[LeetCode&Python] Problem 606. Construct String from Binary Tree

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了[LeetCode&Python] Problem 606. Construct String from Binary Tree，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1404字，纯文字阅读大概需要3分钟。

内容图文

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
        """        
        if t is None: return ""
        res=str(t.val)               
        left=self.tree2str(t.left)
        right=self.tree2str(t.right)
        # if a root doesn't have left children but has right children,
        # we still need to us "()" to represent it.
        if t.right or t.left:
            res=res+"("+left+")"
        if t.right:
            res=res+"("+right+")"
        
        return res

内容总结

以上是互联网集市为您收集整理的[LeetCode&Python] Problem 606. Construct String from Binary Tree全部内容，希望文章能够帮你解决[LeetCode&Python] Problem 606. Construct String from Binary Tree所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端