[leetcode]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.

代码：

public class TreeNode {
	      int val;
	      TreeNode left;
	      TreeNode right;
	      TreeNode(int x) { val = x; }
	 }
	
	public int minDepth(TreeNode root) {
		if(root == null)
			return 0;
		
		return getHigh(root);
    }
	
	public int getHigh(TreeNode root){
		if(root.left == null && root.right ==null)
			return 1;
		
		int lmin = Integer.MAX_VALUE;
		int rmin = Integer.MAX_VALUE;
		if(root.left != null)
			lmin = getHigh(root.left);
		if(root.right !=null)
			rmin = getHigh(root.right);
		
		return Math.min(lmin, rmin)+1;
	}