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

---
 .../104-maximum-depth-of-binary-tree.mdx      | 39 +++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 apps/docs/content/(tree)/104-maximum-depth-of-binary-tree.mdx

diff --git a/apps/docs/content/(tree)/104-maximum-depth-of-binary-tree.mdx b/apps/docs/content/(tree)/104-maximum-depth-of-binary-tree.mdx
new file mode 100644
index 0000000..b9d97b6
--- /dev/null
+++ b/apps/docs/content/(tree)/104-maximum-depth-of-binary-tree.mdx
@@ -0,0 +1,39 @@
+---
+title: '104. Maximum Depth of Binary Tree'
+description: Given the root of a binary tree, return its maximum depth
+sidebar:
+  label: 'Maximum Depth of Binary Tree'
+  badge: 'Easy'
+---
+
+<Badge variant="accent">Tree DFS</Badge>
+
+### 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`
+
+## Solution
+
+```py
+# 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))
+```