7 int_list_head* list_head = create_int_list();
8 int* numbers = (
int*)malloc(20*
sizeof(
int));
9 for (
int i = 0; i < 20; i++) {
12 insert_tail_int_node(&numbers[i], list_head);
14 int_list_goto_head(list_head);
15 while (list_head->curr !=
NULL) {
16 printf(
"%d\n", *access_int_list_current(list_head));
17 int_list_next_ele(list_head);
19 int_list_prev_ele(list_head);
20 printf(
"%d\n", *access_int_list_current(list_head));
21 insert_before_curr_int_node(&numbers[11], list_head);
22 int_list_prev_ele(list_head);
23 printf(
"%d\n", *access_int_list_current(list_head));
25 while (list_head->curr !=
NULL) {
26 printf(
"%d\n", *access_int_list_current(list_head));
27 int_list_next_ele(list_head);