Solutions for Okasaki's "Purely functional data structures" book

• 2 Persistence
  • 2.1 Lists
    • Exercise 2.1 Idris
  • 2.2 Binary Search Trees
    • Set type classes
    • Exercises 2.2-2.5
• 3 Some Familiar Data Structures in a Functional Setting
  • 3.1 Leftist Heaps
    • Heap type class
    • Exercise 3.2
    • Exercise 3.3
    • Exercise 3.4
  • 3.2 Binomial Heaps
    • Exercise 3.5
    • Exercise 3.6
    • Exercise 3.7
  • 3.3 Red-Black Trees
    • Exercises 3.8-3.10
• 4 Lazy Evaluation
  • 4.2 Streams
    • Exercise 4.2
• 5 Fundamentals of Amortization
  • 5.2 Queues
    • Queue
    • Exercise 5.1
  • 5.4 Splay Heaps
    • Exercise 5.4
  • 5.5 Pairing Heaps
    • Exercise 5.8
• 6 Amortization and Persistence via Lazy Evaluation
  • 6.3 The Banker's Method
    • LazyBatchedQueue
  • 6.4 The Physicist's Method
    • PhysicistsQueue
    • Sortable
  • 6.5 Lazy Pairing Heaps
    • LazyPairingHeap