sdfsdf

#include <stdio.h>
#include < stdlib.h>
typedef int list_item;
typedef struct list {
    int data;
    struct list* next;
}list;

struct list* head = NULL, *pos;

int isEmpty(list* head) {
    return (head == NULL) ? 1 : 0;
}

struct list* addNode(int num)
{
    struct list *node = (list*)malloc(sizeof(list));
    node->data = num;
    node->next = NULL;
    if (isEmpty(head))
    {
        head = node;
        head->next = NULL;
        pos = head;
    }
    else {
        pos->next = node;
        pos = pos->next;
        pos->next = head;
    }
}

struct list* bigger(list *head)
{

    int max = head->data;
    int before = head->data;

    while (head != NULL)
    {
        if (head->data > max)
        {
            max = head->data;
        }
        else if (head->data < max && head->data > before)
        {
            before = head->data;
        }

        head = head->next;
    }

    free(before);



}


void display()
{
    struct list* current;
    if (isEmpty(head))
    {
        printf("List is empty");
    }
    else {
        current = head;
        do {
            printf("%d ", current->data);
            current = current->next;
        } while (current != head);
        printf("\n");
    }
}


void main()
{
    list* node = head;
    int num, len, i;
    do {
        printf("\nHow many numbers you want in the list ? ");
        scanf("%d", &len);
        if (len <= 0)printf("List must have more numbers than 0");
    } while (len <= 0);
    printf("\nPlease enter %d numbers", len);
    for (i = 0; i < len; i++)
    {
        scanf("%d", &num);
        addNode(num);
    }
    bigger(head);
    display();
}