226. 翻转二叉树

最新推荐文章于 2025-11-30 19:11:04 发布

原创最新推荐文章于 2025-11-30 19:11:04 发布 · 106 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #leetcode #动态规划 #深度优先

# 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 is None:
            return root 
        root.left =self.invertTree(root.left)
        root.right=self.invertTree(root.right)
        root.left,root.right = root.right,root.left 
        return root