翻转一棵二叉树。
示例:
输入:
4
/ \
2 7
/ \ / \
1 3 6 9
输出:
4
/ \
7 2
/ \ / \
9 6 3 1
链接:https://leetcode-cn.com/problems/invert-binary-tree
class Solution:
def inverseTree(self,root:TreeNode)->TreeNode:
if not root:return None
root.left, root.right = root.right, root.left
self.inverseTree(root.left)
self.inverseTree(root.right)
return root
Leetcode 226. 翻转二叉树 (每日一题 20210819)
最新推荐文章于 2024-03-08 13:33:16 发布