leetcode笔记 111. Minimum Depth of Binary Tree & 112. Path Sum

leetcode刷题16天
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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its minimum depth = 2.

代码：

class Solution {
    public static int minDepth(TreeNode root) {
           if(root==null)
        	return 0;
        if(root.left == null && root.right == null) 
        	return 1;
        if(root.left==null)
        	return minDepth(root.right)+1;
        if(root.right==null)
        	return minDepth(root.left)+1;
        return Math.min(minDepth(root.left),minDepth(root.right))+1;
    }

}

112. Path Sum
     Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ \
7 2 1
return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.
代码：

class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
    	if(root==null)
    		return false;
    	sum = sum-root.val;
        if(root.left==null&&root.right==null)
        	return sum==0;
        return  hasPathSum(root.right,sum)||hasPathSum(root.left,sum);
    }
}