@@ -0,0 +1,513 @@
+package leetcode;%0A%0A/**%0A * https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/%0A */%0Apublic class Problem111 %7B%0A    public class TreeNode %7B%0A        int val;%0A        TreeNode left;%0A        TreeNode right;%0A%0A        TreeNode(int x) %7B%0A            val = x;%0A        %7D%0A    %7D%0A%0A    public int maxDepth(TreeNode root) %7B%0A        if (root == null) %7B%0A            return 0;%0A        %7D%0A        int left = maxDepth(root.left) + 1;%0A        int right = maxDepth(root.right) + 1;%0A        return Math.max(left, right);%0A    %7D%0A%7D%0A

Solve problem 111