Module containers::collections::b_tree [−][src]
Expand description
Balanced search trees
Structs
A B-node has m
key-value pairs, and m+1
children if it is a stem, with the keys between
the children so each key is greater than all keys in its left subtree and less than all keys
in its right subtree.
A node other than the root has b-1 ≤ m ≤ 2b-1
, where b
is the branching parametre of the
tree; the root may have fewer.