Leetcode 226.翻转二叉树
1 题目描述(Leetcode题目链接)
翻转一棵二叉树。
输入:
4
/ \
2 7
/ \ / \
1 3 6 9
输出:
4
/ \
7 2
/ \ / \
9 6 3 1
2 题解
递归,左右交换。
# 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: TreeNode) -> TreeNode:
if not root:
return None
temp = root.right
root.right = self.invertTree(root.left)
root.left = self.invertTree(temp)
return root