Our Data Structure Library Files

Status: Beta

Brought to you by: richselian

The interactive file manager requires Javascript. Please enable it or use sftp or scp.
You may still browse the files here.

Name	Modified	Size
ArrayTree-20101013.tar.bz2	2010-10-13	2.5 kB
ScapegoatTree-20100926.tar.bz2	2010-09-26	2.7 kB
RandomizedHeap-20100922.tar.bz2	2010-09-22	1.6 kB
SplayTree-20100922.tar.bz2	2010-09-21	2.3 kB
TreapTree-20100922.tar.bz2	2010-09-21	2.3 kB
SbTree-20100922.tar.bz2	2010-09-21	2.5 kB
SkewHeap-20100922.tar.bz2	2010-09-21	1.6 kB
SkipList-20100922.tar.bz2	2010-09-21	2.0 kB
PairingHeap-20100922.tar.bz2	2010-09-21	2.1 kB
RbTree-20100922.tar.bz2	2010-09-21	2.7 kB
BinaryHeap-20100922.tar.bz2	2010-09-21	1.9 kB
BinomialHeap-20100922.tar.bz2	2010-09-21	2.3 kB
LeftistHeap-20100922.tar.bz2	2010-09-21	1.7 kB
AvlTree-20100922.tar.bz2	2010-09-21	2.4 kB
Totals: 14 Items		30.6 kB

Other Useful Business Software

Auth for GenAI | Auth0

Enable AI agents to securely access tools, workflows, and data with fine-grained control and just a few lines of code.

Easily implement secure login experiences for AI Agents - from interactive chatbots to background workers with Auth0. Auth for GenAI is now available in Developer Preview

Try free now

MongoDB 8.0 on Atlas | Run anywhere

Now available in even more cloud regions across AWS, Azure, and Google Cloud.

MongoDB 8.0 brings enhanced performance and flexibility to Atlas—with expanded availability across 125+ regions globally. Build modern apps anywhere your users are, with the power of a modern database behind you.

Learn More

Recommended Projects

Database Primitives Library
A library providing basic building blocks for creating in-memory databases of important data. Existing components are: Linked lists; Hash tables with optional auto-resize; Memory-efficient sparse matrices built on hash tables; Red-black trees. NOTE: This project is moving to Github; https://github.com/klmitch/dbprim
Generic Data Structures Library (in C)
A Generic Data Structures Library. A collection of data structures you're most likely to need. Written in ANSI C. Interface is basic, but powerful, and intuitive. Has AVL tree, binary heap, queue/linked list, and more. All platforms.
nedtries
A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.
Ansible-lint
Best practices checker for Ansible

Our Data Structure Library Files

Get an email when there's a new version of Our Data Structure Library