Data Structures using C

Skip lists are a type of data structure that allows fast search, insertion, and deletion operations within an ordered sequence of elements. They are a probabilistic alternative to balanced trees and can be viewed as a linked list with multiple levels of additional pointers.

Simple library for creating and managing a simple linked lists.

Data Structure & Algorithms implementation using C language

🚀 Multiple Projects done in C programming language during the ALX Low Level programming steeplechase track , Cohort 19

Codam libft project - recreate C Library functions

A program that sorts the females in alphabetical order and the males in reverse alphabetical order in a given list using linked lists.

🚀 Multiple Projects done in C programming language during the ALX Low Level programming steeplechase track , Cohort6

A simple implementation of linked lists in C

Important OS Codes and Concepts(Sorted)

Relearning C programming, algorithms, and graphs and created documented examples with explanations

Bst implementation in c.

Lily is a library to manage linked lists in C following EPITECH's format rules

Linked list programs

LINKED LIST ,STRUCT AND FILE OPERATIONS

A native implementation of circular doubly linked list C

A nice and simple way to visualise a ton of data structures

Une implementation des Listes generique en C