@@ -0,0 +1,585 @@
+/**%0A *Given a binary tree, find its maximum depth.%0A *%0A *The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.%0A */%0A/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Aclass Solution %7B%0A    public int maxDepth(TreeNode root) %7B%0A        if (root == null) return 0;%0A        %0A        int left = maxDepth(root.left);%0A        int right = maxDepth(root.right);%0A        return Math.max(left, right) + 1;%0A    %7D%0A%7D%0A

Create MaximumDepthOfBinaryTree.java