Tree - hasPathSum

Author: edyluisrey

src/leetcode2018/Trees.java

@@ -5,6 +5,8 @@
 import java.util.List;
 import java.util.Queue;
 
+import amazon.TreeNode;
+
 
 public class Trees {
 
@@ -134,6 +136,16 @@ public List<List<Integer>> levelOrder(TreeNode root) {
 	        return re;
 	 }
 
+	 public boolean hasPathSum(TreeNode root, int sum) {
+			if(root==null) return false;  
+			System.out.println(root.val);
+			if(root.left==null && root.right==null) {
+				System.out.println(root.val +" ="+ sum);
+				return sum == root.val;
+			}
+			return  hasPathSum(root.left, sum-root.val) || hasPathSum(root.right,sum-root.val);
+	 }
+	 
 }
 
 class TreeNode{