Elementary Functional Algorithms
by Xinyu Liu
This book presents elementary functional algorithms and data structures with 120 exercises and answers.
- Preface to the second edition
- Preface to the first edition
- Chapter 1: List
- Chapter 2: Binary Search Tree
- Chapter 3: Insertion Sort
- Chapter 4: Red-Black Tree
- Chapter 5: AVL Tree
- Chapter 6: Radix Tree, Trie and Prefix Tree
- Chapter 7: B-Tree
- Chapter 8: Binary Heaps
- Chapter 9: Selection Sort
- Chapter 10: Binomial Heap, Fibonacci Heap, and Pairing Heap
- Chapter 11: Queue
- Chapter 12: Sequence
- Chapter 13: Quick Sort and Merge Sort
- Chapter 14: Solution Search I
- Chapter 15: Solution Search II
- Appendix A: Imperative Delete for Red-Black Tree
- Appendix B: AVL Tree — Proofs and the Delete Algorithm