B-tree
/ˈbiːtriː/noun
- Computing an organizational structure for information storage and retrieval in the form of a tree in which all terminal nodes are the same distance from the base, and all non-terminal nodes have between n and 2n subtrees or pointers (where n is an integer)【计算机】B树。