Update Invert Binary Tree - Leetcode 226.py

Author: rai-abhi24

Invert Binary Tree - Leetcode 226.py

@@ -10,3 +10,6 @@ def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
         self.invertTree(root.right)
 
         return root
+
+# Time Complexity: O(n)
+# Space Complexity: O(h) { here "h" is the height of the tree }