B+ tree
An mary rooted tree / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about B+ tree?
Summarize this article for a 10 year old
A B+ tree is an mary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes and leaves.^{[1]} The root may be either a leaf or a node with two or more children.
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)

B+ tree  

Type  Tree (data structure)  

A B+ tree can be viewed as a Btree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves.
The primary value of a B+ tree is in storing data for efficient retrieval in a blockoriented storage context — in particular, filesystems. This is primarily because unlike binary search trees, B+ trees have very high fanout (number of pointers to child nodes in a node,^{[1]} typically on the order of 100 or more), which reduces the number of I/O operations required to find an element in the tree.