606_construct_string_from_binary_tree.py

# 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: TreeNode) -> str:
 if t == None:
 return ''
 elif (t != None) and (t.left == None) and (t.right == None):
 return str(t.val)
 elif (t != None) and (t.left != None) and (t.right == None):
 return str(t.val) + '(' + self.tree2str(t.left) + ')'
 elif (t != None) and (t.left == None) and (t.right != None):
 return str(t.val) + '()' + '(' + self.tree2str(t.right) + ')'
 else:
 return str(t.val) + '(' + self.tree2str(t.left) + ')' + '(' + self.tree2str(t.right) + ')'

'''
 This is my personal record of solving Leetcode Problems. 
 If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
 Copyright (C) 2020-2022 mengxinayan

 This program is free software: you can redistribute it and/or modify
 it under the terms of the GNU General Public License as published by
 the Free Software Foundation, either version 3 of the License, or
 (at your option) any later version.

 This program is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 GNU General Public License for more details.

 You should have received a copy of the GNU General Public License
 along with this program. If not, see <http://www.gnu.org/licenses/>.
'''