- 2 Persistence
- 2.1 Lists
- 2.2 Binary Search Trees
- 3 Some Familiar Data Structures in a Functional Setting
- 3.1 Leftist Heaps
- 3.2 Binomial Heaps
- 3.3 Red-Black Trees
- 4 Lazy Evaluation
- 4.2 Streams
- 5 Fundamentals of Amortization
- 5.2 Queues
- 5.4 Splay Heaps
- 5.5 Pairing Heaps
- 6 Amortization and Persistence via Lazy Evaluation
- 6.3 The Banker's Method
- 6.4 The Physicist's Method
- 6.5 Lazy Pairing Heaps
george-lukas / okasaki Goto Github PK
View Code? Open in Web Editor NEWThis project forked from kgeorgiy/okasaki
Solutions for Okasaki's "Purely functional data structures" book