From 50299defef0731c17be4d13eb6630f7422f840ec Mon Sep 17 00:00:00 2001
From: Prad Nukala <prad@sonr.io>
Date: Thu, 3 Sep 2026 13:52:57 -0400
Subject: [PATCH] feat(work): add Maximum Depth of Binary Tree solution

---
 .../Tree/104.maximum-depth-of-binary-tree.py  | 46 +++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 work/1/Easy/Tree/104.maximum-depth-of-binary-tree.py

diff --git a/work/1/Easy/Tree/104.maximum-depth-of-binary-tree.py b/work/1/Easy/Tree/104.maximum-depth-of-binary-tree.py
new file mode 100644
index 0000000..f891673
--- /dev/null
+++ b/work/1/Easy/Tree/104.maximum-depth-of-binary-tree.py
@@ -0,0 +1,46 @@
+"""
+104. Maximum Depth of Binary Tree
+Difficulty: Easy
+https://leetcode.com/problems/maximum-depth-of-binary-tree/
+
+──────────────────────────────────────────────────
+
+Given the root of a binary tree, return its maximum depth.
+
+A binary tree's maximum depth is the number of nodes along the
+longest path from the root node down to the farthest leaf node.
+
+
+
+Example 1:
+
+Input: root = [3,9,20,null,null,15,7]
+Output: 3
+
+Example 2:
+
+Input: root = [1,null,2]
+Output: 2
+
+
+
+Constraints:
+
+        • The number of nodes in the tree is in the range [0, 10^4].
+
+        • -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 maxDepth(self, root: Optional[TreeNode]) -> int:
+        if not root:
+            return 0
+
+        return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))