chapter 2 中序遍历二叉树+双指针

#中序遍历返回有序数组
#双指针高效

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
    void inorder(TreeNode* root,vector<int> &result){
        if(root){
            inorder(root->left,result);
            result.push_back(root->val);
            inorder(root->right,result);

        }  
    } 
    bool findTarget(TreeNode* root, int k) {
        vector<int> res;
        inorder(root,res);
        int Lp=0,Rp=res.size()-1;
        for(;Lp<Rp;){
            if(res[Lp]+res[Rp]==k)return true;
            else if(res[Lp]+res[Rp]<k)Lp++;
            else if(res[Lp]+res[Rp]>k)Rp--;
        }
        return false;
    }
};