[LeetCode] 226. Invert Binary Tree

#Binary_Tree  #Recursion  #BFS  #DFS

URL

Invert Binary Tree - LeetCode

 

Intuition

• Recursion 사용

 

Solution

# 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 root is None:
            return None
        root.left, root.right = root.right, root.left
        root.left = self.invertTree(root.left)
        root.right = self.invertTree(root.right)

        return root

.