2 ms·
Red-black trees in Haskell, using GADTs and zippers (2012)
- josephcsible 4y agoThe neat thing here is that all of the red-black tree's invariants are statically guaranteed to always hold. For example, if you wrote code that could ever make an unbalanced tree, you'll get a compiler error.