Leetcode-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 Solution {
   	public boolean Recursive(TreeNode root, int sum){
		if( root == null ) return false;
		if( root.left == null && root.right == null && sum-root.val == 0 ) return true;
		return Recursive(root.left, sum-root.val)||Recursive(root.right, sum-root.val);
	}
	public boolean DFS(TreeNode curNode, int sum, int curSum ){
		if( curNode == null ) return false;
		if( curNode.left == null && curNode.right == null )
			return curSum + curNode.val == sum;
		return DFS( curNode.left, sum, curSum+curNode.val )||DFS(curNode.right, sum, curSum+curNode.val);
	}
    public boolean hasPathSum(TreeNode root, int sum) {
        // return Recursive(root, sum);
        return DFS(root, sum, 0);
    }
}