MaximumDepthOfBinaryTree leetcode problem

Author: C5141506

src/main/problems/java_problem/binarytree/MaximumDepthOfBinaryTree.java

@@ -0,0 +1,39 @@
+package java_problem.binarytree;
+
+class TreeNode {
+ int val;
+ TreeNode left;
+ TreeNode right;
+
+ TreeNode() {
+ }
+
+ TreeNode(int val) {
+ this.val = val;
+ }
+
+ TreeNode(int val, TreeNode left, TreeNode right) {
+ this.val = val;
+ this.left = left;
+ this.right = right;
+ }
+}
+
+
+public class MaximumDepthOfBinaryTree {
+
+ public static void main(String[] args) {
+ TreeNode treeNode = new TreeNode(1);
+ treeNode.left = null;
+ treeNode.right = new TreeNode(10);
+ System.out.println(maxDepth(treeNode));
+ }
+
+ public static int maxDepth(TreeNode root) {
+ if (root == null) return 0;
+ int left = maxDepth(root.left);
+ int right = maxDepth(root.right);
+ return Math.max(left, right) + 1;
+ }
+
+}