trees Definition B-Tree A B-tree or (a,b)-Tree (2≤a≤b) is a tree where each tree node (except root) has between a and b children, and all leaves are at the same depth (have the same distance to the root).