Assertion: b tree | /r/HasProperty | balanced
Facets:
value: of 2 d
type: OTHER
value: after deletion
type: TEMPORAL
value: by merging or redistributing keys
type: MANNER
value: similarly
type: MANNER
value: after insertion
type: TEMPORAL
Source sentences:
text: A B-tree is kept balanced after insertion by splitting a would-be overfilled node, of 2 d + 1 {\displaystyle 2d+1} keys, into two d {\displaystyle d} -key
text: Similarly, a B-tree is kept balanced after deletion by merging or redistributing keys among siblings to maintain the d {\displaystyle d} -key minimum for non-root nodes.