What are 2-3 Trees?
An introduction to “2-3” trees, their properties, and an example with the basic operations that this data structure offers.
We'll cover the following...
Introduction
A 2-3 tree is another form of search tree, but it is very different from the binary search tree. Unlike BST, 2-3 tree is a balanced and ordered search tree, which provides a very efficient storage mechanism to guarantee fast operations. In this chapter, you will take a detailed look at 2-3 trees’ structure, the limitations it follows, and how elements are inserted and deleted from it. One key feature of a 2-3 tree is that it remains balanced. It does not matter how many insertions or deletions you perform. The leaf nodes are always present on the same level and are small in number. This is to make sure the height doesn’t increase up to a certain level as the time complexity of all the operations are mainly ...