struct node
        int n
        struct node *next

void new_head(struct node *ptr_head, int x)
        struct node *tmp

        tmp = malloc(size(struct node))
        tmp->n = x
        tmp->next = *ptr_head
        *ptr_head = tmp

int ll_size(struct node *head)
        struct node *tmp = head
        int total

        total = 0
        while (tmp != NULL)
                total++
                tmp = tmp->next

        return total

int main()
        struct node *head = NULL

        new_head(&head, 4)
        new_head(&head, 5)
        new_head(&head, 6)

        print "Size of linked list = ", ll_size(head)

        return 0