翻转一棵二叉树。
示例:
输入:
4 / \ 2 7 / \ / \ 1 3 6 9
输出:
4 / \ 7 2 / \ / \ 9 6 3 1
思路:
递归,注意备份一下root.left 和root.right,因为会被覆盖
class Solution(object):
def invertTree(self, root):
"""
:type root: TreeNode
:rtype: TreeNode
"""
if not root:
return root
left = root.left
right = root.right
root.right = self.invertTree(left)
root.left = self.invertTree(right)
return root