@@ -0,0 +1,306 @@
+package leetcode.oj.maxmiumDepthOfBST;%0A%0Aclass TreeNode %7B%0A%09int val;%0A%09TreeNode left;%0A%09TreeNode right;%0A%0A%09TreeNode(int x) %7B%0A%09%09val = x;%0A%09%7D%0A%7D%0A%0Apublic class Solution %7B%0A%09%0A%09public int maxDepth(TreeNode root) %7B%0A%09%09if (root == null)%0A%09%09%09return 0;%0A%09%09return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));%0A%09%7D%0A%0A%7D%0A

add code