InvertBinaryTree

Published at 2021-11-20

# 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]:
        def doReverse(node):
            if node:
                node.left, node.right = doReverse(node.right), doReverse(node.left)
            return node

        return doReverse(root)