Test case failing, not sure why

#1
#2 
void findInRange(node *root, int min, int max)
{
	if(root==NULL){return;}
	if(root->data>=min && root->data<=max)
	{
		findInRange(root->left, min, max);
		cout<<root->data<<" ";
		findInRange(root->right, min, max);
	}
}

suppose root is 10 and min and max are 20 30 resp
then your code returns(do nothing)
but keys may present on right side
so you have to call on left and right as well

void findInRange(node *root, int min, int max)
{
	if(root==NULL){return;}
	if(root->data>=min && root->data<=max)
	{
		
		cout<<root->data<<" ";

	}
    findInRange(root->left, min, max);
  	findInRange(root->right, min, max);

}

i hope this help
if you have more doubts regarding this feel free to ask
if your doubt is resolved mark it as resolved from your doubt section inside your course