我有这个代码：

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

typedef struct Node
{
    int x;
    struct Node *next;
} Node;

void deallocate(Node **root)
{
    Node *curr = *root;
    while (curr != NULL)
    {
        Node *aux = curr;
        curr = curr->next;
        free(aux);
    }
    *root = NULL;
}

void insert_end(Node **root, int value)
{
    Node *new_node = malloc(sizeof(Node));
    if (new_node == NULL)
    {
        exit(1);
    }
    new_node->next = NULL;
    new_node->x = value;

    if (*root == NULL)
    {
        *root = new_node;
        return;
    }

    Node *curr = *root;
    while (curr->next != NULL)
    {
        curr = curr->next;
    }
    curr->next = new_node;
}

void deserialize(Node **root)
{
    FILE *file = fopen("duom.txt", "r");
    if (file == NULL)
    {
        exit(2);
    }

    int val;
    while (fscanf(file, "%d, ", &val) > 0)
    {
        insert_end(root, val);
    }
    fclose(file);
}
int largestElement(struct Node *root)
{
    int max = INT_MIN;
    while (root != NULL)
    {
        if (max < root->x)
            max = root->x;
        root = root->next;
    }
    return max;
}

void deleteN(Node **head, int position)
{
    Node *temp;
    Node *prev;
    temp = *head;
    prev = *head;
    for (int i = 0; i < position; i++)
    {
        if (i == 0 && position == 1)
        {
            *head = (*head)->next;
            free(temp);
        }
        else
        {
            if (i == position - 1 && temp)
            {
                prev->next = temp->next;
                free(temp);
            }
            else
            {
                prev = temp;

                // Position was greater than
                // number of nodes in the list
                if (prev == NULL)
                    break;
                temp = temp->next;
            }
        }
    }
}

int main()
{
    Node *root = NULL;

    printf("MENU:\n");
    printf("if you press 0 the list will be created \n");
    printf("if you press 1 the list will be printed on a screen\n");
    printf("if you press 2 it deletes the biggest element\n");
    printf("if you press 3 the program ends\n\n");

    int meniu;
    printf("press:\n");
    scanf("%d", &meniu);
    while (meniu != 3)
    {
        if (meniu == 0)
        {
            deserialize(&root);
            printf("sarasas sukurtas.\n");
        }

        if (meniu == 1)
        {
            for (Node *curr = root; curr != NULL; curr = curr->next)
                printf("%d\n", curr->x);
        }
        if (meniu == 2)
        {
            int max_element = largestElement(root);
            printf("%d max\n", max_element);
            deleteN(&root, max_element);

        }
        printf("press:\n");
        scanf("%d", &meniu);
    }

    deallocate(&root);
    return 0;
}

当我编译并运行delete函数时，它第一次只删除最大的数字，如果我第二次调用它，它会删除列表中的最后一个数字。有人能帮我解决这个问题吗？
我编辑了它，这样所有的代码都可以看到，因为很难像以前那样理解它