I believe I once had a short book by CMU's Daniel Sleator and a co-author where they explained some examples showing how different data structures could change

I believe I once had a short book by CMU's Daniel Sleator and a co-author where they explained some examples showing how different data structures could change the complexity/run-time of algorithms. Can't find either my copy or online references.