2-3 Insertion

Introduction

Insertion in 2-3 trees is different from binary search trees. In 2-3 trees, values are only inserted at leaf nodes based on certain conditions. As discussed before, the insertion algorithm takes $O(Logn)$ time where n is the number of nodes in the tree. Searching an element is done in $Log\left(n\right)$ ...