From fec94ed636f44bea86669e053a211dea93f57d93 Mon Sep 17 00:00:00 2001
From: Prad Nukala <prad@sonr.io>
Date: Thu, 3 Sep 2026 14:01:06 -0400
Subject: [PATCH] =?UTF-8?q?feat(work):=20add=20solution=20for=20Invert=20B?=
 =?UTF-8?q?inary=20Tree=20(LC=E2=80=AF226)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 work/1/Easy/Tree/226.invert-binary-tree.py | 54 ++++++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 work/1/Easy/Tree/226.invert-binary-tree.py

diff --git a/work/1/Easy/Tree/226.invert-binary-tree.py b/work/1/Easy/Tree/226.invert-binary-tree.py
new file mode 100644
index 0000000..c687cd1
--- /dev/null
+++ b/work/1/Easy/Tree/226.invert-binary-tree.py
@@ -0,0 +1,54 @@
+"""
+226. Invert Binary Tree
+Difficulty: Easy
+https://leetcode.com/problems/invert-binary-tree/
+
+──────────────────────────────────────────────────
+
+Given the root of a binary tree, invert the tree, and return its root.
+
+
+
+Example 1:
+
+Input: root = [4,2,7,1,3,6,9]
+Output: [4,7,2,9,6,3,1]
+
+Example 2:
+
+Input: root = [2,1,3]
+Output: [2,3,1]
+
+Example 3:
+
+Input: root = []
+Output: []
+
+
+
+Constraints:
+
+        • The number of nodes in the tree is in the range [0, 100].
+
+        • -100 <= Node.val <= 100
+"""
+
+
+# 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
+
+        left = self.invertTree(root.left)
+        right = self.invertTree(root.right)
+
+        root.left = right
+        root.right = left
+
+        return root