Root to Leaf Sum

public static boolean hasPathSum(Node node, int sum) {
 // return true if we run out of tree and sum==0
 if (node == null) {
 return(sum == 0);
 else {
 // otherwise check both subtrees
 int subSum = sum -;
 System.out.println("subsum testting = "+subSum);
 return(hasPathSum(node.left, subSum) || hasPathSum(node.right, subSum));

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: