Create 226_InvertBinaryTree.py

Author: duncanmichel

LeetCode/226_InvertBinaryTree.py

@@ -0,0 +1,45 @@
+"""
+
+
+Runtime
+34 ms
+Beats
+84.37%
+Memory
+13.8 MB
+Beats
+56.90%
+"""
+
+# 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
+        return TreeNode(root.val,self.invertTree(root.right),self.invertTree(root.left))
+      
+
+      
+"""
+Recursive Approach
+class Solution(object):
+    def invertTree(self, root):
+        # Base case...
+        if root == None:
+            return root
+        # swapping process...
+        root.left, root.right = root.right, root.left
+        # Call the function recursively for the left subtree...
+        self.invertTree(root.left)
+        # Call the function recursively for the right subtree...
+        self.invertTree(root.right)
+        return root     # Return the root...
+
+"""
+
+