2-3 Insertion
This lesson will explain how insertion is done in 2-3 Trees based on multiple scenarios that are explained with the insertion algorithm.
We'll cover the following...
Introduction
Insertion in 2-3 Trees is a lot different from the insertion in Binary Search Trees. In 2-3 Trees, values are only inserted at leaf nodes at certain conditions. As discussed before, the insertion algorithm takes time where n is the number of nodes in the tree. Searching an element is done in ...