Implementing B+ Trees On Disk With OCaml, Part 2 - Disk Layout, Memory Representation, and (De)Serialization.

Welcome back to part 2 of this series, in which we are implementing a disk backed B+ tree. In this part we will go over the B+ tree in-memory data structure, how to serialize that data structure into a disk layout, and how to deserialize the disk layout back into the in-memory node type.