Implementation of tree types - Week 10

Last week I have been working on the universal B tree. I finished the implementation of the bound and wrote a series of tests.

In order to explain what the bound is I have to introduce the notions ${area}$ and ${address}$.

An ${address}\ $ for an ${area}$ in an $n$-dimensional cube is a sequence $i_1.i_2..i_l$, where $i_j 1,2,,2^n