2-3 Trees

This is an implementation of 2-3 trees: a B tree with M = L = 3. As class names cannot begin with numbers, the class is called a B23_tree.

Currently, only insertion and printing work.