Leetcode226. 翻轉二叉樹

翻轉一棵二叉樹。

示例：

輸入：

     4
   /   \
  2     7
 / \   / \
1   3 6   9
輸出：

     4
   /   \
  7     2
 / \   / \
9   6 3   1

思路

左右遞歸替換，每個節點運行一遍，O(n)。

# 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 invertTree(self, root):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
        if root == None:return None
        right = self.invertTree(root.right)
        left = self.invertTree(root.left)
        root.left  = right
        root.right = left
        return root