Balanced-tree-based maps are a workhorse in functional programming. Because of their disarming simplicity, Chris Okasaki's purely functional red-black trees are a popular means for implementing such maps. In his book, self-balancing binary search trees are less than a page of code. Except that delete is left as an exercise to the reader. Unfortunately, deletion is tricky. Stefan Kahrs devised a wi