DaleStudy · sounmind · Apr 28, 2025 · Apr 23, 2025
diff --git a/maximum-depth-of-binary-tree/sounmind.js b/maximum-depth-of-binary-tree/sounmind.js
diff --git a/maximum-depth-of-binary-tree/sounmind.py b/maximum-depth-of-binary-tree/sounmind.py
@@ -0,0 +1,19 @@
+from typing import Optional
+
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
+
+class Solution:
+    def maxDepth(self, root: Optional[TreeNode]) -> int:
+        if not root:
+            return 0
+
+        left_depth = self.maxDepth(root.left)
+        right_depth = self.maxDepth(root.right)
+
+        return 1 + max(left_depth, right_depth)