二叉树的翻转 ,就是前面加个swap函数,交换左右子树
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if not root:
return None
root.left, root.right = root.right, root.left #中
self.invertTree(root.left) #左
self.invertTree(root.right) #右
return root
二叉树的翻转 ,就是前面加个swap函数,交换左右子树
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if not root:
return None
root.left, root.right = root.right, root.left #中
self.invertTree(root.left) #左
self.invertTree(root.right) #右
return root
本文标题:2023-03-13 二叉树的翻转
本文链接:https://www.haomeiwen.com/subject/oqmfrdtx.html
网友评论