Leetcode 226. 翻转二叉树---python

题目描述：
翻转一棵二叉树。
示例：
输入：

解题思路：
采用自顶向下左右子树交换的方法，先把右子树保存下来，避免覆盖，然后交换。

代码实现：

    def invertTree(self, root):
        if(root == None):
            return
        rightTree = root.right
        root.right = self.invertTree(root.left)
        root.left = self.invertTree(rightTree)
        return root

代码测试以及运行结果：

# Definition for a binary tree node.
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class Solution:
    def __init__(self):
        self.res = list()

    def invertTree(self, root):
        if(root == None):
            return
        rightTree = root.right
        root.right = self.invertTree(root.left)
        root.left = self.invertTree(rightTree)
        return root

    #中序遍历验证是否翻转正确
    def inorderTraversal(self, root: TreeNode):
        if root:
            self.t(root)
        return self.res

    def t(self, root):
        if root.left != None:
            self.t(root.left)
        self.res.append(root.val)
        if root.right != None:
            self.t(root.right)


root = TreeNode(3)
n1 = TreeNode(2)
root.left = n1
n2 = TreeNode(4)
root.right = n2
n1.left = TreeNode(0)
n2.right = TreeNode(8)

s = Solution()
Head =s.invertTree(root)
result = s.inorderTraversal(Head)
print(result)

运行结果：

[8, 4, 3, 2, 0]