C Linked List mentoring work.
cd codequestions
make clean
make
./listdemo
- Explain the structure of the code, why
list.h
andlist.c
- How is
main.c
able to use functions fromlist.c
? - Why do
list_remove_at
,list_prepend
andlist_free
take astruct list_node **
- Why do the other functions take a
struct list_node *
- Explain how
list_remove_at
works - What does
list_free
do and why should we use this? - Explain how
list_size_recursive
works - Could any of the other list functions be made recursive?
- Why is there a
do { ... } while(condition);
loop in list_print rather than awhile(condition) { ... }
- Draw a pictorial representation of a list with the following nodes stored in it: 6, 7, 8