Search⌘ K
Home
Courses
Data Structures for Coding Interviews in C#

2-3 Insertion

Explore the insertion process in 2-3 trees, focusing on inserting values at leaf nodes and handling node splits. Understand how to maintain balanced trees by promoting median elements and learn the algorithm's O(log n) time complexity to build efficient tree structures in C#.

We'll cover the following...

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)O(Logn) time where n is the number of nodes in the tree. Searching an element is done in ...