Expert C++ by Marcelo Guerra Hahn | Araks Tigranyan | John Asatryan | Vardan Grigoryan | Shunguang Wu

Author:Marcelo Guerra Hahn | Araks Tigranyan | John Asatryan | Vardan Grigoryan | Shunguang Wu
Language: eng
Format: epub, mobi
Publisher: Packt Publishing Pvt Ltd
Published: 2023-08-07T00:00:00+00:00

Insertion

As with the find function, in the case of the insert function, we are going to first look at the illustrations of how inserting elements into a 2-3 tree works. We will perform insertion with the following elements:

{19, 7, 11, 21, 14, 13, 12}

Insert 19 into a node:

Figure 7.10 – Inserting 19 into a node

Check whether a node is a two-node or a three-node. If it is a two-node, compare the element with the element of the two-node and insert it, making necessary changes.

Figure 7.11 – Inserting 7 into a node that already has 1 element

Now we have a three-node node and we want to make another insertion but there is no place, as the maximum number of keys is two, so we have to make structural changes:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.