We use the following book:

• Data Structures and Algorithm Analysis in Java,
  Mark Allen Weiss,
  third edition.

Please note that the book contains exercises, but no solutions. There are solutions for the problems from the old exams. Also you can find some other interesting problems here: here. If you want to consult other books on Data Structures, you can consider these classical resources:

• Introduction to Algorithms,
  Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein.
• Algorithms,
  Robert Sedgewick och Kevin Wayne.

For functional data structures, we use the following resources:

• Bror Bjerners Haskellkompendium (source code).

• Ralf Hinzes Explaining binomial heaps (alternative link, source code).

More literature on functional data structures:

• Ralf Hinzes A Simple Implementation Technique for Priority Search Queues (alternativ länk)

• Chris Okasakis Purely Functional Data Structures (a short version of his thesis) is a classic resource, but maybe too advanced for this course.

• for the very motivated students: What's new in purely functional data structures since Okasaki?