Lintcode_11 Search Range in Binary Search Tree

Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree. Find all the keys of tree in range k1 to k2. i.e. print all x such that k1<=x<=k2 and x is a key of given BST. Return all the keys in ascending order.

Example

If k1 = 10 and k2 = 22, then your function should return [12, 20, 22].

    20
   /  \
  8   22
 / \
4   12

用BFS解决问题：

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param root: The root of the binary search tree.
     * @param k1 and k2: range k1 to k2.
     * @return: Return all keys that k1<=key<=k2 in ascending order.
     */
    vector<int> searchRange(TreeNode* root, int k1, int k2) {
        // write your code here
        vector<int> res;
        if (root == NULL)
           return res;
        TreeNode* node1 = root;
        TreeNode* node2 = root;
        res = dfs(root, k1, k2);
        return res;
    }
    vector<int> dfs(TreeNode* node, int k1, int k2) {
        vector<int> res;
        if (node == NULL)
           return res;
        if (node->left != NULL)
           res = dfs(node->left, k1, k2);
        if (k1 <= node->val && node->val <= k2)
           res.push_back(node->val);
        if (node->right != NULL) {
           vector<int> right_vec = dfs(node->right, k1, k2);
           res.insert(res.end(), right_vec.begin(), right_vec.end());
        }
        return res;
    }
};