Hello! Author here - thanks for your interest in the book!
Very good point regarding Python 3 - I think I need to reword the sentence about Python 2 versus 3. The main point was actually to indicate that the book is now compatible with Python 3. However, it just so happens to also still be compatible with Python 2, since the code is simple enough that it didn’t need to rely on idioms unique to Python 3. I hope that makes sense. But we’ll try to reword based on your suggestion.
With regard to Volume 2 - it’s an exciting new project I’m working on now, and hope to have out next year some time. It continues from where Volume 1 leaves off, and introduces the reader to additional concepts of DSA that build upon the knowledge of Volume 1. Topics include (but are not limited to - and also subject to change):
- Mergesort
- Benchmarking
- Randomization Algorithms
- Caching (plus LRU Cache)
- Red-Black Trees
- Treaps
- Approximation Algorithms
- Bloom Filters
- Dealing with NP-Complete problems
- B-Trees
- Minimum Spanning Trees
- Topological Sort
- Bipartite Matching
- Parallel Algorithms
I hope that helps!
-Jay