B trees
B Trees are Multiway trees with the following
characteristics: n is the Order of the B tree.
- Every page contains at most 2n items (keys)
- Every page except the root contains at least n items
- Every page is either
- a leaf page i.e. has no descendants
- has m+1 descendants where m is the number of keys
- All leaf pages appear at the same level