From a764ed9a951d41f3b27934bbafac2a9b8bf5944e Mon Sep 17 00:00:00 2001 From: rimgosu Date: Fri, 18 Sep 2026 08:39:08 +0000 Subject: [PATCH] 226 --- .../v3/226. Invert Binary Tree.py" | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 "leetcode3/\353\263\200\354\247\200\355\230\221/v3/226. Invert Binary Tree.py" diff --git "a/leetcode3/\353\263\200\354\247\200\355\230\221/v3/226. Invert Binary Tree.py" "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/226. Invert Binary Tree.py" new file mode 100644 index 000000000..3d09ce8a7 --- /dev/null +++ "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/226. Invert Binary Tree.py" @@ -0,0 +1,27 @@ +# 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: TreeNode | None) -> TreeNode | None: + if root is None: + return None + + def dfs(c: TreeNode) -> TreeNode: + print(c) + val = c.val + left = c.left + right = c.right + new_right = None + new_left = None + + if left: + new_right = dfs(left) + if right: + new_left = dfs(right) + + return TreeNode(val, new_left, new_right) + + return dfs(root)