Find the minimum path sum for binary tree (From root to leaf)

minPathSum.java

// Find the minimum path sum (from root to leaf)
public static int minPathSum(TreeNode root) {
	if(root == null) return 0;
	int sum = root.val;
	
	int leftSum = minPathSum(root.left);
	int rightSum = minPathSum(root.right);
	
	if(leftSum < rightSum){
		sum += leftSum;
	}else{
		sum += rightSum;
	}
	
	return sum;
}