B-Trees. Katherine Gurdziel 252a-ba. Outline. What are b-trees? How does the algorithm work? Insertion Deletion Complexity What are b-trees used for? LEDA for AVL and Red Black trees. Description. B-trees are balanced search trees with one root B-tree nodes can have multiple children
T = 3 so a node can hold at most 5 keys.
h <= logt (n+1)/2
It is the same for insertion and deletion.