226. 翻转二叉树

最新推荐文章于 2025-05-10 18:09:08 发布

ranzhiyimu

最新推荐文章于 2025-05-10 18:09:08 发布

阅读量81

点赞数 2

文章标签：算法 leetcode 动态规划深度优先

本文链接：https://blog.youkuaiyun.com/ranzhiyimu/article/details/147054302

版权

# 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