Insert Operation - 2-3 Tree

Insert into 2-node at bottom

  • Search for key as usual

  • Replace 2-node with 3-node

Insert into 3-node at bottom

  • Add new key to 3-node to make it to 4-node

  • Move middle key of 4-node to parent

  • Repeat up the tree as necessary

  • if you reach the root, and it is 4-node then split it into three 2-nodes.

Root Having 3-node

Last updated