Purely functional data structures

Most books on data structures suggest the use of an imperative programming language, for example, C/C ++ or Java. However, the implementation of data structures in such languages ​​is far from always well tolerated to functional programming languages, such as standard ML, Haskell or Scheme. This book of data structures describe from the point of view of functional languages, it contains examples and offers design approaches that can be used by developers in creating their own data structures. The book includes both classic data structures, for example, red-black trees and binomial queues, and some new data structures created specifically for functional languages. The entire source code is given on the standard ML and Haskell, and most programs are easy to adapt to other functional programming languages.
This publication is a reference guide for professional programmers working with functional languages, and can also be used as a textbook for independent study.
On the website of the Publishing House of DMK Press, an archive with the original texts of the implementation of all data structures in languages ​​is a standard ML and HASKELL. They can be used as a basis in performing numerous exercises