2-3 Insertion

This lesson will explain the how insertion is done in 2-3 Trees based on multiple scenarios which are explained in the insertion algorithm.

Introduction

Insertion in 2-3 Trees is a lot 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)O(Logn) ...

Access this course and 1400+ top-rated courses and projects.