1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49
|
class Solution { public boolean findTarget(TreeNode root, int k) { return traval(root,root,k); }
public boolean travel(TreeNode root,TreeNode node, int k){ if(searchVal(root,node,k-node.val)) return true; if(node.left != null){ if(travel(root,node.left,k)){ return true; } } if(node.right != null){ if(travel(root,node.right,k)){ return true; } }
return false; }
public boolean searchVal(TreeNode node,TreeNode src, int val){ if(node == null) return false; if(node.val == val && node != src) return true; else if(val > node.val && node.right != null){ return searchVal(node.right,src,val); } else if(val < node.val && node.left != null){ return searchVal(node.left,src,val); }else{ return false; } } }
|