Skip to content
#

circular

Here are 9 public repositories matching this topic...

This is a simple implementation of a circular linked-list in C. Circular linked-lists are a type of linked-list where the last node points to the first node. This is useful for implementing queues and stacks. This implementation is a doubly linked-list, meaning that each node has a pointer to the next node and a pointer to the previous node.

  • Updated Jan 5, 2023
  • C

Improve this page

Add a description, image, and links to the circular 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 circular topic, visit your repo's landing page and select "manage topics."

Learn more