https://github.com/simonprickett/clinkedlist

C Linked List Mentoring Work
https://github.com/simonprickett/clinkedlist

c data-structures

Last synced: about 1 month ago
JSON representation

C Linked List Mentoring Work

• Host: GitHub
• URL: https://github.com/simonprickett/clinkedlist
• Owner: simonprickett
• Created: 2015-10-13T00:58:53.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2018-09-21T17:48:48.000Z (over 6 years ago)
• Last Synced: 2024-10-29T15:49:36.417Z (3 months ago)
• Topics: c, data-structures
• Language: C
• Homepage: https://simonprickett.dev/
• Size: 6.84 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# C Linked List

C Linked List mentoring work.

## Folder: codequestions

### Instructions

```

cd codequestions

make clean

make

./listdemo

```

### Questions

* Explain the structure of the code, why ```list.h``` and ```list.c```

* How is ```main.c``` able to use functions from ```list.c```?

* Why do ```list_remove_at```, ```list_prepend``` and ```list_free``` take a ```struct 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 a ```while(condition) { ... }```

* Draw a pictorial representation of a list with the following nodes stored in it: 6, 7, 8