10-Sanidade.c

#include <stdio.h>
#include <stdlib.h>

typedef struct node {
    long unsigned int curr;
    long unsigned int prev;
    long unsigned int post;
} node;

typedef node* Item;

typedef struct no_st{
    Item item;
    struct no_st *prox;
}No;

typedef struct header_St{
    No *inicio;
    No *final;
}Header;

int list_initialize(Header *H){
    H -> inicio = NULL;
    H -> final = NULL;

    return 1;
}

int push_back(Header *H, Item insert){
    No *temp = malloc(sizeof(No));
    if(temp == NULL)return 0;

    temp -> item = insert;
    temp -> prox = NULL;
    
    if(H -> final == NULL){H -> final = temp;} 
    else{
        H -> final -> prox = temp;
        H -> final = temp;
    }

    if(H -> inicio == NULL){H -> inicio = H -> final;}

    return 1;
}

void checkSanity(long unsigned int * firstNode, long unsigned int * lastNode, Header *h) {
    if (firstNode[2] == lastNode[0]) {
        if (firstNode[0] == lastNode[1]) {
            printf("sana\n");
            return;
        }
        else {
            printf("insana\n");
            return;
        }
    }
    No *temp = h->inicio;

    while (firstNode[2] != temp->item->curr && temp->prox != NULL) {
        temp = temp->prox;
    }
    if (firstNode[2] == temp->item->curr) {
        firstNode[0] = temp->item->curr;
        firstNode[1] = temp->item->prev;
        firstNode[2] = temp->item->post;
        checkSanity(firstNode, lastNode, h);
    }
    else if (temp->prox == NULL) {
        printf("insana\n");
        return;
    }
}

int main() {
    Header *h = malloc(sizeof(Header));
    list_initialize(h);
    long unsigned int curr, prev, post;

    long unsigned int firstNode[3];
    long unsigned int lastNode[3];

    scanf("%lx %lx %lx", &firstNode[0], &firstNode[1], &firstNode[2]);
    scanf("%lx %lx %lx", &lastNode[0], &lastNode[1], &lastNode[2]);

    while (scanf("%lx %lx %lx", &curr, &prev, &post) == 3) {
        node *n = malloc(sizeof(node));
        n->curr = curr;
        n->prev = prev;
        n->post = post;
        push_back(h, n);
    }

    checkSanity(firstNode, lastNode, h);

}