@@ -0,0 +1,664 @@
+/**%0A * Definition for binary tree%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 */%0Apublic class Solution %7B%0A    public int minDepth(TreeNode root) %7B%0A        return minDepthRecur(root);%0A    %7D%0A    %0A    private int minDepthRecur(TreeNode root) %7B%0A        if(root == null) %7B%0A            return 0;%0A        %7D%0A        %0A        int left = minDepthRecur(root.left);%0A        int right = minDepthRecur(root.right);%0A        if (left == 0) %7B%0A            return right+1;%0A        %7D %0A        if (right == 0) %7B%0A            return left+1;%0A        %7D %0A        return Math.min(left, right) + 1;%0A    %7D%0A%7D%0A

Create Minimum_Depth_Of_Binary_Tree.java