Any node can have at most 1 or 2 values.An intermediate node can have 2 or 3 children.All values that appear on the middle sub-tree are greater than leftmost value in parent node and smaller than right most value in parent node.Ībove is an example for B-Tree of order 3.

A node in B-tree of order n can have at most n-1 values and n children.