ASince each interior node has as many asB-Tree of order mis a search tree, where the data (or pointers to it) is stored at the leaves, such that: 1) the root is either a leaf (as well--i.e. the tree is a single node) or has between 2 andmchildren 2) all other (non-root) nodes have at leastm/2 children, but no more thanmchildren 3) all leaves are at the same depth

So, an interior node with *n* children, will have *n*
pointers (p_{1} to p_{n}) to those children;
it will also have *n-1* keys (k_{1} to k_{n-1}),
where k_{i} is the smallest key stored in the tree pointed
to by p_{i+1}.

Note that some entries in a node can be null--its just important
that the key and its matching pointer are **both** null.