B-trees with GADTs
Channel: Matthew Brecknell
Date: 2015-05-20

I interactively build a simple B-tree data structure in Haskell, implementing insertion and deletion, using a GADT to ensure that I maintain the structural invariant.