二叉树的反转

最新推荐文章于 2022-02-07 00:34:02 发布

ogelp

最新推荐文章于 2022-02-07 00:34:02 发布

阅读量128

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/weixin_39776217/article/details/85250288

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param root: a TreeNode, the root of the binary tree
    @return: nothing
    """
    def invertBinaryTree(self, root):
        # write your code here
        if root is  None:
            return
        
        root.left,root.right  = root.right,root.left
        root.left = self.invertBinaryTree(root.left)
        root.right = self.invertBinaryTree(root.right)
        
        return root

递归思想，先调换，然后往下继续调换！直到none