606. Construct String from Binary Treedigui （递归）

标签：The   ping   present   hat   res   mapping   nat   order   origin   

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:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class Solution:
    def tree2str(self, t):
        """
        :type t: TreeNode
        :rtype: str
        """
        if t is None:
            return ‘‘
        if t.left is None and t.right is None:
            return str(t.val)
        if t.right is None:
            return str(t.val) + ‘(‘ + self.tree2str(t.left) + ‘)‘
        return str(t.val) + ‘(‘ + self.tree2str(t.left) + ‘)(‘ + self.tree2str(t.right) + ‘)‘

由于需要处理空括号的问题，对于右子树为空的情况需要单独处理。

606. Construct String from Binary Treedigui （递归）

标签：The   ping   present   hat   res   mapping   nat   order   origin   

原文地址：https://www.cnblogs.com/bernieloveslife/p/10234010.html