/**
* 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: param root: The root of the binary search tree
* @param k1: An integer
* @param k2: An integer
* @return: 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> re;
if (root!=NULL&&k1<=k2)
{
inOrderTra(root,re,k1,k2);
}
return re;
}
void inOrderTra(TreeNode * root,vector<int> &result,int K1,int K2)
{
if (root->left!=NULL)
{
inOrderTra(root->left,result,K1,K2);
}
if (root->val>=K1&&root->val<=K2)
{
result.push_back(root->val);
}
if (root->right!=NULL)
{
inOrderTra(root->right,result,K1,K2);
}
}
};