> For the complete documentation index, see [llms.txt](https://til.notdu.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://til.notdu.com/database/intro-to-database-systems/tree-indexes-i/b+-tree/properties.md).

# Properties

A B+ Tree is an M-way search tree with the following properties:

-> It is perfectly balanced (i.e, every leaf node is at the same depth).

-> Every node other than the root, is at least half-full M/2-1 <= #keys <= M-1

-> Every inner node with k keys has k+1 non-null children