Description
Invert a binary tree.
Example
4
/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1
Explain
递归翻转即可
Code
# 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 not root:
return []
if root.left or root.right:
tmp = root.left
root.left = root.right
root.right = tmp
if root.left:
self.invertTree(root.left)
if root.right:
self.invertTree(root.right)
return root