Hari Prashanth K R
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.
1Queues
1.1Banker’s Queue
1.2Physicist’s Queue
1.3Implicit Queue
1.4Bootstraped Queue
1.5Real-Time Queue
1.6Hood-Melville Queue
2Deques
2.1Bankers Deque
2.2Implicit Deque
2.3Real-Time Deque
3Heaps
3.1Binomial Heap
3.2Skew Binomial Heap
3.3Leftist Heap
3.4Splay Heap
3.5Pairing Heap
3.6Lazy Pairing Heap
3.7Bootstrapped Heap
4Random Access Lists
4.1Binary Random Access List
4.2Skew Binary Random Access List
5VList
6Streams
7Red-Black Trees
8Tries
9Treap
9.1Priorities
AltStyle γ«γγ£γ¦ε€ζγγγγγΌγΈ (->γͺγͺγΈγγ«) / γ’γγ¬γΉ: γ’γΌγ: γγγ©γ«γ ι³ε£°γγ©γ¦γΆ γ«γδ»γ ι θ²εθ»’ ζεζ‘倧 γ’γγ€γ«