Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings
#

singly-linked-list-in-c

Here are 4 public repositories matching this topic...

data-structures-and-algorithms-in-c

Your one-stop GitHub repo for competitive coding and data structures! πŸ€– Curated notes, practice problems, and real-world applications. Sharpen your skills and ace those interviews! πŸ’»πŸ”₯

  • Updated Jul 16, 2025

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

AltStyle γ«γ‚ˆγ£γ¦ε€‰ζ›γ•γ‚ŒγŸγƒšγƒΌγ‚Έ (->γ‚ͺγƒͺγ‚ΈγƒŠγƒ«) /