Leetcode 226. Invert Binary Tree

Problem

Given the root of a binary tree, invert the tree, and return its root.

Algorithm

Recursive implementation.

Code

# 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 not root:
            return root
        
        if root.left:
            t = root.right
            root.right = root.left
            root.left = t
            root.right = self.invertTree(root.right)
            root.left = self.invertTree(root.left)
        elif root.right:
            root.left = root.right
            root.left = self.invertTree(root.left)
            root.right = None
        
        return root