B-Trees

• Binary trees

• Each node has zero or more subtrees

• Left and right
• Node without a subtree is a leaf
• First node is the root

• Values in left subtree are smaller

• Values in right subtree are greater