A B+ tree is a data structure. It is essentially a B-tree, but the values only occur in the lowest-level leaf nodes. It allows searching, addition and removal of elements, and, optionally by linking each leaf node to another to allow easy traversal, as in a linked list, enumeration of its elements.