@@ -0,0 +1,300 @@
+package leetcode.maximum_depth_of_binary_tree;%0A%0Aimport common.TreeNode;%0A%0Apublic class Solution %7B%0A%09public int maxDepth(TreeNode root) %7B%0A%09%09if(root == null) return 0;%0A%09%09int left = maxDepth(root.left);%0A%09%09int right = maxDepth(root.right);%0A%09%09if(left %3E right) return left + 1;%0A%09%09else return right + 1;%0A%09%7D%0A%7D%0A

Add java solution for 104. Maximum Depth of Binary Tree