int main(int argc, char **argv){
int lenS1;
int lenS2;
if (argc < 3) {
printf("Faltan argumentos, ingrese un texto alfabetico\n");
exit(0);
}
S1 = catPeso(argv[1]);
S2 = catPeso(argv[2]);
lenS1 = strlen(S1);
lenS2 = strlen(S2);
flagString=1;
ST = ukkonen(ST, S1, lenS1, &e1);
//printSTree(ST, 1);
flagString = 2;
flagSpecial = 1;
ST = ukkonen(ST, S2, lenS2, &e2);
//printSTree(ST, 1);
find_longest_common_string();
printf("\nRespuesta: %s\n", find_longest_common_string());
free(S1);
free(S2);
freeSTree(ST);
return 1;
}
/*
* freeSTree
* Function: Free all of the elements contained in the ST
* Parameters: The ST to free
* Return: NULL
*/
SearchTree * freeSTree(SearchTree * sTree)
{
if(sTree != NULL)
{
if(sTree->lChild != NULL)
{
sTree->lChild = freeSTree(sTree->lChild);
}
if(sTree->rChild != NULL)
{
sTree->rChild = freeSTree(sTree->rChild);
}
free(sTree->letterCode);
free(sTree);
}
return(NULL);
}
