leetcode112~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.
For 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.

给出了递归和非递归两种解法
该题没有说明节点的值为正整数，所以必须到叶节点才能进行判断

public class PathSum {
    //递归解法
    public boolean hasPathSum2(TreeNode root, int sum) {
       if(root==null) {
           return false;
       } else if(root.left==null && root.right==null) {
           return sum==root.val;
       } else {
           return hasPathSum2(root.left, sum-root.val) || hasPathSum2(root.right, sum-root.val);
       }
    }

    //非递归解法 两个队列，分别存储节点和根节点到该节点的sum值
    public boolean hasPathSum(TreeNode root,int sum) {
        if(root==null) return false;
        Queue<TreeNode> nodes = new LinkedList<>();
        Queue<Integer> values = new LinkedList<>();
        nodes.offer(root);
        values.offer(root.val);
        while(!nodes.isEmpty()) {
            TreeNode node = nodes.poll();
            int sumvalue = values.poll();
            if(node.left==null&&node.right==null&&sum==sumvalue) {
                return true;
            }
            if(node.left!=null) {
                nodes.offer(node.left);
                values.offer(sumvalue+node.left.val);
            }
            if(node.right!=null) {
                nodes.offer(node.right);
                values.offer(sumvalue+node.right.val);
            }
        }
        return false;
    }
}