LC 0226 [E] Invert Binary Tree - ALawliet/algorithms GitHub Wiki
# 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 None
# swap the children
tempLeft = root.left
root.left = root.right
root.right = tempLeft
self.invertTree(root.left)
self.invertTree(root.right)
return root