33 for(i = 0; i < n; i++) {
36 next_node = next_node->
next;
50 while(node->
next != NULL) {
55 new_node->
next = NULL;
57 node->
next = new_node;
89 while(node->
next != NULL) {
int list_int_size(list_int_node *list)
Get list size.
void list_int_create(list_int_node **list)
Create an empty list.
void list_int_free(list_int_node **list)
Deallocate this list and all lists it is linked to.
int list_int_get(list_int_node *list, int index)
Retrieve the data stored in a list node.
void list_int_add(list_int_node *list, int data)
Add new node to the end of the chain.
Linked list node that stores int data.
struct list_int_node * next