Leetcode学习笔记:#653. Two Sum IV - Input is a BST
Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
实现:
public boolean findTarget(TreeNode root, int k){
HashSet<Integer> set = new HashSet<>();
return dfs(root, set, k);
}
public boolean dfs(TreeNode root, HashSet<Integer> set, int k){
if(root == null) return false;
if(set.contains(k-root.val))
return true;
set.add(root.val);
return dfs(root.left, set, k) || dfs(root.right, set, k);
}
思路:
用set保存树节点的值,只要有k-root.val的值就返回true: