bool missing(node *root,int low,int high)
{
  if(root == nullptr)
    return true;
  if(low <= root->data && root->data <= high)
    return false;
  if(high < root->data)
    return missing(root->left,low,high);
  else
    return missing(root->right,low,high);
}