记录刷题 2024/06/30
226. 翻转二叉树
给你一棵二叉树的根节点 root ,翻转这棵二叉树,并返回其根节点。
直接贴代码和注释
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
if root == None:
return None
# 翻转
root.right, root。left = root.left, root.right
# 翻转左子树(先序)
self.invertTree(root.left)
# 翻转右子树
self.invertTree(root.right)
return root