Skip to content

Latest commit

 

History

History

0x13-more_singly_linked_lists

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

More singly linked lists

Project done during Full Stack Software Engineering studies at ALX AFRICA SE. It aims to learn about singly linked lists in C language.

Technologies

  • C files are compiled using gcc
  • Tested on Ubuntu 20.04 LTS

Files

All of the following files are programs written in C:

Filename Description
0-print_listint.c Prints all the elements of a listint_t list
1-listint_len.c Returns the number of elements in a linked listint_t list
2-add_nodeint.c Adds a new node at the beginning of a listint_t list
3-add_nodeint_end.c Adds a new node at the end of a listint_t list
4-free_listint.c Frees a listint_t list
5-free_listint2.c Frees a listint_t list
6-pop_listint.c Deletes the head node of a listint_t linked list, and returns the head node's data (n)
7-get_nodeint.c Returns the nth node of a listint_t linked list
8-sum_listint.c Returns the sum of all the data (n) of a listint_t linked list
9-insert_nodeint.c Inserts a new node at a given position
10-delete_nodeint.c Deletes the node at index index of a listint_t linked list
100-reverse_listint.c Reverses a listint_t linked list
101-print_listint_safe.c Prints a listint_t linked list
102-free_listint_safe.c Frees a listint_t list
103-find_loop.c Finds the loop in a linked list

  • Write a function that prints all the elements of a listint_t list.
  • Write a function that returns the number of elements in a linked listint_t list.
  • Write a function that adds a new node at the beginning of a listint_t list.
  • Write a function that adds a new node at the end of a listint_t list.
  • Write a function that frees a listint_t list.
  • Write a function that frees a listint_t list.
  • Write a function that deletes the head node of a listint_t linked list, and returns the head node’s data (n).
  • Write a function that returns the nth node of a listint_t linked list.
  • Write a function that returns the sum of all the data (n) of a listint_t linked list.
  • Write a function that inserts a new node at a given position.
  • Write a function that deletes the node at index index of a listint_t linked list.
  • Write a function that reverses a listint_t linked list.
  • Write a function that prints a listint_t linked list.
  • Write a function that frees a listint_t list.
  • Write a function that finds the loop in a linked list.

Author

Acknowledgements 🙏

All work contained in this project was completed as part of the curriculum for ALX Africa SE. ALX Africa is an online full-stack software engineering program that prepares students for careers in the tech industry using project-based peer learning. For more information, visit this link.

ALX Africa Logo