leetcode 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.
题意：判断是否可以从二叉搜索树中找到两个数的和等于目标数。
思路：
1. 二叉搜索树中序遍历后得到有序数组
2. 从有序数组中找两个数的和为目标数。定义两个指针，一个指向数组头，一个指向数组尾，若两个数的和大于目标数，则右指针左移，否则左指针右移。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool findTarget(TreeNode* root, int k) {
        vector<int> ans;
        sortedArray(root, ans);
        return findTargetInSortedArray(ans, k);        
    }
private:
    void sortedArray(TreeNode* root, vector<int>& ans) {
        if (root == NULL) return;
        sortedArray(root->left, ans);
        ans.push_back(root->val);
        sortedArray(root->right, ans);
    }
    bool findTargetInSortedArray(vector<int> ans, int k) {
        for (int i = 0, j = ans.size() - 1; i < j;) {
            int sum = ans[i] + ans[j];
            if (sum == k) return true;
            else if (sum < k) i++;
            else j--;
        }
        return false;
    }
};