9.32.txt

数据结构实验 如下： Status Fibonacci(int k, int m, int &f) /* 求k阶斐波那契序列的第m项的值f */

void Out_X(BiTree t, KeyType x, KeyType &a, KeyType &b,int &last);

void OutX(BiTree t, KeyType x, KeyType &a, KeyType &b)
/* a: Return the nearest and smaller value to x, */
/*    but return MINV if no the value in t.      */
/* b: Return the nearest and larger  value to x. */
/*    but return MAXV if no the value in t.      */
{
    int last = 0;
    a = b = 0;
    Out_X(t, x, a, b, last);
    if(a == 0) a = MINV;
    if(b == 0) b = MAXV;
}


void Out_X(BiTree t, KeyType x, KeyType &a, KeyType &b,int &last)
{
    if(t->lchild) Out_X(t->lchild, x, a, b, last);
    if(last < x && t->data.key >= x) a = last;
    if(last <= x&& t->data.key > x) b = t->data.key;
    last = t->data.key;
    if(t->rchild) Out_X(t->rchild, x, a, b, last);
    else if( last < x) a = last;
}