力扣 226. 翻转二叉树

2022-08-28

Word count: 48 | Reading time≈ 1 min

前置

class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

递归

def invertTree(root):
    if not root: return root
    invertTree(root.left)
    invertTree(root.right)
    root.left, root.right = root.right, root.left
    return root

Copyright： Copyright is owned by the author. For commercial reprints, please contact the author for authorization. For non-commercial reprints, please indicate the source.