9.33.txt

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

void OrderOut(BiTree t, KeyType x, void(*visit)(TElemType))
/* Output is to use visit(t->data);  */
{
    if(t == NULL) return ;
    if(t->rchild != NULL) 
        OrderOut(t->rchild, x, visit);
    if(t->data.key >= x) 
        visit(t->data);
    if(t->lchild != NULL)
        OrderOut(t->lchild, x, visit);        
}