Skip to content


Here are 112 public repositories matching this topic...

Easy implementation of various Data Structures in Java language. Red-Black Tree, Splay Tree, AVLTree, PriorityQueue, Doubly-Linked-List, Stack, Queue, Array, ArrayList, Disjoint-Set,Binary-Search Tree, B-Tree.

  • Updated Oct 19, 2018
  • Java

Algorithms and ADTs • binary search algorithm • conditions necessary for the use of a binary search • performance of a binary search • implement an insertion sort • implement a bubble sort • performance of a sort routine • find an item in : linked list, binary tree, hash table • insert an item: stack, queue, linked list, binary tree, hash table …

  • Updated Sep 6, 2023
  • Python

CircularDict is a high-performance Python data structure that blends the functionality of dictionaries and circular buffers. Inheriting the usage of traditional dictionaries, it allows you to define constraints on size and memory usage. Ideal for caching large data structures while maintaining control over memory footprint.

  • Updated May 13, 2024
  • Python

Improve this page

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

Learn more