A Pythonic indexed priority queue
-
Updated
Sep 19, 2026 - Python
A Pythonic indexed priority queue
SortedTables in Nim, based on B-Trees
Skip Lists: A generalization of sorted linked lists for implementing Dictionary ADT (insert, delete, find, min, floor, ceiling) in O(log n) expected time per operation. And competing with balanced search trees like AVL, Red-Black, and B-Trees.
Redis with Sorted Dictionaries
Python dictionary in which the keys are always in ascending order
To associate your repository with the sorted-dict topic, visit your repo's landing page and select "manage topics."