Added Max Depth o fBinary Tree

MichaelVandi · MichaelVandi · commit 2d67f2628be4 · 2020-09-17T14:25:36.000-04:00
diff --git a/Easy/09_17_2020_maximum_depth_of_binary_tree.java b/Easy/09_17_2020_maximum_depth_of_binary_tree.java
@@ -0,0 +1,14 @@
+/**
+ * Time: O(n)
+ * Space: O(d) where d is the depth of the deepest path
+ */
+class Solution {
+    public int maxDepth(TreeNode root) {
+        if (root == null) return 0;
+        // Find the length of the left and right children paths
+        int left = maxDepth(root.left);
+        int right = maxDepth(root.right);
+        // return the max of left and right length plus 1
+        return Math.max(left, right) + 1;
+    }
+}
