翻转一棵二叉树。
示例:
输入:
4 / \ 2 7 / \ / \ 1 3 6 9
输出:
4 / \ 7 2 / \ / \ 9 6 3 1
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if not root:
return root
root.left,root.right = self.invertTree(root.right),self.invertTree(root.left)
return root