Question

Exercise 5 Given a BST with numeric values and two numbers a and b, write down a function that returns a list with all items between a and b. The idea is to do this without visiting all elements, if possible.

Answer 1

void NUMBERS(Node *root, int a, int b)
{

if ( root == NULL) // base case
return;


if ( a < root->data )//for accessing elements above a
{
NUMBERS(root->left, a, b);
}

if ( a <= root->data && b >= root->data )
{
cout<<root->data
}
  
if ( b > root->data ) //for accessing elements below b
{
NUMBERS(root->right, a, b);
}
}