//검증된 쿼리를 이용해서 트리를 제작해오기
void Query::makeTree()
{
//T.splitQuery(query);
//T.treeTraversal();
//qTree = T.getResult();
//T.clear();
qTree = splitQuery(query);
}
int main(){
char query[20];
listaCurso *LC=NULL;
Pessoa *p=NULL;
Query *Q=NULL;
int elements;
LC=abreFicheiro(LC);
printf("Introduza a query: ");
scanf("%s",query);
Q=splitQuery(query);
p=procuraQuery(LC,Q);
p=ordena(p);
elements=totalElements(p);
printf("%d\n",elements);
show(p);
return (0);
}
