算法导论 练习题 14.3-5

pRBT intervalSearchExactly(pRBT root,KT i)
{
pRBT x=root;
if(x==NULL)
return nil;
if(x->key->low==i->low && x->key->high==i->high)
return x;
else if(isOverlap(x->key,i))
{
if(i->low<=x->key->low)
x=intervalSearchExactly(x->left,i);
else
x=intervalSearchExactly(x->right,i);
}
else
{
if(x->key->high<i->low)
x=intervalSearchExactly(x->right,i);
if(x->key->low>i->high)
x=intervalSearchExactly(x->left,i);
}
return x;
}