Skip to content
#

singly-linked-list-in-c

Here are 4 public repositories matching this topic...

data-structures-and-algorithms-in-c

This is a simple implementation of a singly linked-list in C. Singly linked-lists are a type of data structure that are used to store a collection of elements. Each element in a singly linked-list is called a node. Each node contains two parts: the data and a pointer to the next node. The first node in a singly linked-list is called the head.

  • Updated Dec 20, 2022
  • C

Improve this page

Add a description, image, and links to the singly-linked-list-in-c topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the singly-linked-list-in-c topic, visit your repo's landing page and select "manage topics."

Learn more

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy