adding updates

src/my_project/interviews/google_top_exercises/round_1/16_invert_binary_tree.py

@@ -0,0 +1,18 @@
+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) -> TreeNode:
+
+        try: 
+            root.val
+        except:
+            return root
+
+        root.left, root.right = (self.invertTree(root.right),
+                                 self.invertTree(root.left))
+
+        return root