New purely functional data structures published since 1998: 2001: Ideal Hash Trees, and its 2000 predecessor, Fast And Space Efficient Trie Searches, by Phil Bagwell: Apparently used as a fundamental building block in Clojure's standard library. 2001: A Simple Implementation Technique for Priority Search Queues, by Ralf Hinze: a really simple and beautiful technique for implementing this important
![What's new in purely functional data structures since Okasaki?](https://cdn-ak-scissors.b.st-hatena.com/image/square/ebb8b5025066cad26162f92ee8e879a308cafe96/height=288;version=1;width=512/https%3A%2F%2Fcdn.sstatic.net%2FSites%2Fcstheory%2FImg%2Fapple-touch-icon%402.png%3Fv%3Dda033b2b5220)