LeetCode-树-中序遍历(DFS)-二叉搜索树中两个节点之和

1 题目

剑指 Offer II 056. 二叉搜索树中两个节点之和

653. 两数之和 IV - 输入 BST

2 代码实现

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool findTarget(TreeNode* root, int k) {
        vector<int> v;
        dfs(root, v);
        int i = 0, j = v.size()-1;
        while(i<j)
        {
            if (v[i]+v[j] < k)
            {
                ++i;
            }
            else if (v[i]+v[j] > k)
            {
                --j;
            }
            else
            {
                return true;
            }
        }

        return false;
    }

    void dfs(TreeNode* root, vector<int>& v)
    {
        if (!root)
            return;
        dfs(root->left, v);
        v.push_back(root->val);
        dfs(root->right, v);
    }
};