Lintcode/src/chapter3_binary_tree_and_divide_and_conquer/

fishercoder1534 · fishercoder1534 · commit 481c5d2f2f72 · 2016-09-08T21:20:25.000-07:00
diff --git a/Lintcode/src/chapter3_binary_tree_and_divide_and_conquer/MaximumDepthofBinaryTree.java b/Lintcode/src/chapter3_binary_tree_and_divide_and_conquer/MaximumDepthofBinaryTree.java
@@ -0,0 +1,21 @@
+package chapter3_binary_tree_and_divide_and_conquer;
+
+import classes.TreeNode;
+
+public class MaximumDepthofBinaryTree {
+
+    /**
+     * @param root: The root of binary tree.
+     * @return: An integer.
+     */
+    
+    //1 min easy AC! Cheers!
+    public int maxDepth(TreeNode root) {
+        // write your code here
+        if(root == null) return 0;
+        int left = maxDepth(root.left);
+        int right = maxDepth(root.right);
+        return Math.max(left, right)+1;
+    }
+
+}
