@@ -0,0 +1,379 @@
+package leetcode.minimum_depth_of_binary_tree;%0A%0Aimport common.TreeNode;%0A%0Apublic class Solution %7B%0A%09public int minDepth(TreeNode root) %7B%0A%09%09if(root == null) return 0;%0A%09%09if(root.left == null)%7B%0A%09%09%09return minDepth(root.right) + 1; %0A%09%09%7Delse if(root.right == null)%7B%0A%09%09%09return minDepth(root.left) + 1;%0A%09%09%7Delse%7B%0A%09%09%09return Math.min(minDepth(root.left), minDepth(root.right)) + 1;%0A%09%09%7D%0A%09%7D%0A%0A%7D%0A

Add java solution for 111. Minimum Depth of Binary Tree