B Trees!!!

B trees are a unique type of search tree that are not limited to a max number of children.

This is an example of a B tree.

• Degree m is the max number of children beneath any node
• Max number of any values in any node is (m-1)
• Internal nodes have at least m/2 children

If you want to learn more about B trees, go to the B tree wikipedia page.