int PrintList(list l)
{
if (l == NULL)
{
fprintf(stderr, "Lista vuota!\n");
return EXIT_FAILURE;
}
printf("Stampo gli elementi della lista...\n");
while (empty(tail(l)) == false)
{
PrintElement(l->value);
printf("\n");
l = tail(l);
}
PrintElement(l->value);
printf("\n");
printf("Elementi terminati;\n");
return EXIT_SUCCESS;
}
int test_ASInsert(tASTable *TempTable, int Key, int Content) {
solved=TRUE;
ASInsert(TempTable, Key, Content);
if (!solved) {
printf("Operace ASInsert() nebyla implementovana \n");
return(FALSE);
}
else {
PrintElement(TempTable);
return(TRUE);
}
}
Status PreOrderTraverse(BiTree T)
{
// 前序遍历二叉树T的递归算法，对每个数据元素调用函数Visit。
//补全代码,可用多个语句
if(T)
{
if(PrintElement(T->data))
if(PreOrderTraverse(T->lchild))
if(PreOrderTraverse(T->rchild))
return OK;
return ERROR;
}else return OK;
} // PreOrderTraverse
int test_ASSearch (tASTable *TempTable, int Content, int *ind) {
solved=TRUE;
int found;
ASCompNum = 0;
found = ASSearch(TempTable, Content, ind);
if (!solved) {
printf("Operace ASSearch() nebyla implementovana \n");
return(FALSE);
}
else {
PrintElement(TempTable);
printf("Hodnota nalezena: ");
if (found)
printf("ANO\n");
else
printf("NE\n");
printf("Index vr�cen: %d\n", *ind);
printf("Po�et proveden�ch porovn�n�: %d\n", ASCompNum);
printf("=========================================================\n");
ASCompNum = 0;
return(TRUE);
}
}
