2100 by Jurg Nievergelt, ETH Zurich, Klaus Hinrichs, University of Muenster.
Introductory coverage of algorithms and data structures with application to graphics and geometry. Reissue of the same title in 1993 by Prentice Hall.

2013 by Pat Morin, Carleton University.
Offered as an introduction to the field of data structures and algorithms. Covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.
Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists, implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; graphs, including adjacency matrix and adjacency list representations; and B-trees.