int quartiere(stradario s1, stradario s2) {
    if (s1 == NULL)
        return 0;
    else {
        if(s2!=NULL) {
            if (strcmp(s1->info, s2->info) == 0)
                return uguali(s1, s2);   //to be implemented
            return quartiere(s1->left, s2) || quartiere(s1->right, s2);
        }
        else
            return 1;
    }
    
}
int uguali(stradario s1, stradario s2) {
    if(s2==NULL) return 1;
    else {
        return strcmp(s1->info, s2->info)==0 && uguali(s1->left, s2->left) && uguali(s1->right, s2->right);
    }
}
示例#3
0
 int uguali(Albero a1, Albero a2) {
   // testa l'uguaglianza
     return (a1 != NULL) || (a2 != NULL) && (a1->element == a2->element) && uguali(a1->left, a2->left) && uguali(a1->right, a2->right) ? 1 : 0;
 }