111. Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

package leetCode;

/**
 * Created by lxw, liwei4939@126.com on 2018/3/24.
 */
public class L111_MinimumDepthOfBinaryTree {

    public int minDepth(TreeNode root){
        if (root == null){
            return 0;
        }

        if (root.left == null && root.right == null){
            return 1;
        } else if (root.left != null && root.right == null){
            return minDepth(root.left) + 1;
        } else if (root.left == null && root.right != null){
            return minDepth(root.right) + 1;
        } else {
            return Math.min(minDepth(root.left), minDepth(root.right)) + 1;
        }
    }
}