/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean findTarget(TreeNode root, int k) {
ArrayList<Integer> list=new ArrayList<>();
inorder(root,list);
int l=0,r=list.size()-1,sum=0;
while(l<r){
sum=list.get(l)+list.get(r);
if(sum==k) return true;
else if(sum<k){
l++;
}else if(sum>k){
r--;
}
}
return false;
}
public void inorder(TreeNode root,ArrayList<Integer> list){
if(root!=null){
inorder(root.left,list);
list.add(root.val);
inorder(root.right,list);
}
}
}