Skip to content
#

singly-linked-list-in-c

Star

Here are 3 public repositories matching this topic...

Dare-marvel / Data-Structures-and-Competitive-Programming--DS-CP----

Star 5

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! 💻🔥

heapsort breadth-first-search depth-first-search expression-tree doubly-linked-list graph-traversal-algorithms linear-probing avl-tree-implementations quadratic-probing data-structures-in-java infix-to-postfix infix-to-prefix stack-operations binary-search-tree-operations linked-list-in-c hash-table-c data-structures-in-c singly-linked-list-in-c insertion-in-heap deletion-in-heap
  • Updated Feb 16, 2024

BaseMax / SinglyLinkedListC

Star 0

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.

c data-structure linked-list linkedlist datastructure singly-linked-list singly-linked-list-in-c singly-linkedlist
  • 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