Skip to content
#

circular-doubly

Here are 2 public repositories matching this topic...

This is a simple implementation of Circular Doubly Linked-List in C. Circular Doubly Linked-List is a data structure that is a combination of a doubly linked list and a circular linked list. It is a linked list where all nodes are connected to each other. It is a circular linked list because all nodes are connected to each other.

  • Updated Dec 19, 2022
  • C

A comprehensive implementation and analysis of the Circular Doubly Linked List data structure, covering theoretical time complexity, space complexity, and low-level memory allocation with alignment and padding concepts.

  • Updated May 6, 2026

Add this topic to your repo

To associate your repository with the circular-doubly topic, visit your repo's landing page and select "manage topics."

Learn more