You are here
HomeBtree
Primary tabs
Btree
A Btree of order $m$ is a balanced search tree in which

the root has at least 2 children if it is not a leaf,

all leaf nodes appear on the same level

a nonleaf node with $k$ children has $k1$ keys.
If the tree has $n$ nodes its height is $O(log_{2}(n))$.
Defines:
order
Type of Math Object:
Definition
Major Section:
Reference
Mathematics Subject Classification
68P10 no label found68P05 no label found Forums
 Planetary Bugs
 HS/Secondary
 University/Tertiary
 Graduate/Advanced
 Industry/Practice
 Research Topics
 LaTeX help
 Math Comptetitions
 Math History
 Math Humor
 PlanetMath Comments
 PlanetMath System Updates and News
 PlanetMath help
 PlanetMath.ORG
 Strategic Communications Development
 The Math Pub
 Testing messages (ignore)
 Other useful stuff
 Corrections