1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
|
class : def __init__(self, x): self.val = x self.left = None self.right = None
class Solution: def invertTree(self, root): """ :type root: TreeNode :rtype: TreeNode """ if not root: return root self.invertTree(root.left) self.invertTree(root.right) root.left, root.right = root.right, root.left return root
tree = TreeNode(3) left_tree = TreeNode(9) right_tree = TreeNode(20) right_tree.left = TreeNode(15) right_tree.right = TreeNode(7) tree.left = left_tree tree.right = right_tree print(Solution().invertTree(tree))
|
近期评论