Not. A node in a B * tree can have many keys (which points to many children). They work by comparing keys to select a child element that looks like a binary tree. But the goal is that each node is stored on disk and can be immediately read into memory. Thus, the number of required disk accesses should correspond to the depth of the tree.