https://github.com/basemax/circularlinkedlistc
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.
https://github.com/basemax/circularlinkedlistc
c circular circular-linked-list circular-linkedlist data-structure datastructure ds linked-list linkedlist
Last synced: 2 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/basemax/circularlinkedlistc
- Owner: BaseMax
- License: gpl-3.0
- Created: 2022-12-19T07:43:14.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2023-01-05T17:31:09.000Z (over 2 years ago)
- Last Synced: 2025-03-28T17:08:04.440Z (2 months ago)
- Topics: c, circular, circular-linked-list, circular-linkedlist, data-structure, datastructure, ds, linked-list, linkedlist
- Language: C
- Homepage:
- Size: 27.3 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0