0x13-more_singly_linked_lists

0x13. C - More singly linked lists

Description

What you should learn from this project:

• How to use linked lists
• Start to look for the right source of information without too much help

---

0. Print list

• Write a function that prints all the elements of a listint_t list.

1. List length

• Write a function that returns the number of elements in a linked listint_t list.

2. Add node

• Write a function that adds a new node at the beginning of a listint_t list.

3. Add node at the end

• Write a function that adds a new node at the end of a listint_t list.

4. Free list

• Write a function that frees a listint_t list.

5. Free

• Write a function that frees a listint_t list.

6. Pop

• Write a function that deletes the head node of a listint_t linked list, and returns the head node’s data (n).

7. Get node at index

• Write a function that returns the nth node of a listint_t linked list.

8. Sum list

• Write a function that returns the sum of all the data (n) of a listint_t linked list.

9. Insert

• Write a function that inserts a new node at a given position.

10. Delete at index

• Write a function that deletes the node at index index of a listint_t linked list.

11. Reverse list

• Write a function that reverses a listint_t linked list.

12. Print (safe version)

• Write a function that prints a listint_t linked list.

13. Free (safe version)

• Write a function that frees a listint_t list.

14. Find the loop

• Write a function that finds the loop in a linked list.

---

Author

• Geoffrey Zoref - Gzoref