Functional Data Structures in Typed Racket🔗ℹ

The data structures in this library are based on the work of Chris Okasaki and Phil Bagwell, including those in the Purely Functional Data Structures by Okasaki. All of the data structures are implemented in Typed Racket.

1 Queues

1.1 Banker’s Queue

1.2 Physicist’s Queue

1.3 Implicit Queue

1.4 Bootstraped Queue

1.5 Real-Time Queue

1.6 Hood-Melville Queue

3.2 Skew Binomial Heap

3.3 Leftist Heap

3.4 Splay Heap

3.5 Pairing Heap

3.6 Lazy Pairing Heap

3.7 Bootstrapped Heap

4 Random Access Lists

4.1 Binary Random Access List

4.2 Skew Binary Random Access List

1	Queues
2	Deques
3	Heaps
4	Random Access Lists
5	VList
6	Streams
7	Red-Black Trees
8	Tries
9	Treap