226.翻转二叉树
描述
翻转一棵二叉树。
示例
我
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def invertTree(self, root):
"""
:type root: TreeNode
:rtype: TreeNode
"""
if root is None:
return root
else:
root.right, root.left = self.invertTree(root.left), self.invertTree(root.right)
return root