Have Geek Brain

B-trees that use reallocation on insert

If I insert the letters A, G, I, and Y into a B-tree of order 4 (which means 4 pointers and 3 elements in each node), I get the following B-tree.

  G
 / \
A   IY

Would it look different if reallocation on insert was used? How does the redistribution on insert work?

+2


a source to share


1 answer


This question is like a circular. Reallocation in data structures is often done for balancing purposes. B-trees are inherently balanced, so the question becomes "what is the reason for reallocation on insert?" And in this case, the algorithm will depend on what you were trying to achieve.



B-trees can perform reallocation on deletion; is this what you mean? Or do you have links to links?

+1


a source






More articles:


All Articles