Invert Binary Tree
4
/ \
2 7
/ \ / \
1 3 6 9 4
/ \
7 2
/ \ / \
9 6 3 1Last updated
4
/ \
2 7
/ \ / \
1 3 6 9 4
/ \
7 2
/ \ / \
9 6 3 1Last updated
# 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
node = TreeNode(root.val)
node.right = self.invertTree(root.left)
node.left = self.invertTree(root.right)
return node