title: B-trees that use redistribution on insertion
body: <p>If I insert the letters A, G, I, and Y into a B-tree of order 4 (meaning 4 pointers and 3 elements in each node), I get the following B-tree.</p>
  
  <pre><code>  G
   / \
  A   IY
  </code></pre>
  
  <p>Would it look any different if redistribution on insertion were used?  How does redistribution on insertion work?</p>