[Leetcode] Invert Binary Tree

solution for Invert Binary Tree

 

 

Problem)

Invert a binary tree.

 

 

Example)

 

Solution)

class Solution:
    def invertTree(self, root: TreeNode) -> TreeNode:
        if root:
            root.left, root.right = self.invertTree(root.right), self.invertTree(root.left)
            return root
        else:
            return None

 

 

Reference)

Recursion (Recursive Function)