🌲 A C++ implementation of all functionalities (insertion, deletion, search etc) of a 2-3 (two-three) Tree using Rotation, Split and Merge operations. (Please share if you find any bug in the code)
-
Updated
Jan 17, 2021 - C++
🌲 A C++ implementation of all functionalities (insertion, deletion, search etc) of a 2-3 (two-three) Tree using Rotation, Split and Merge operations. (Please share if you find any bug in the code)
This C++ program implements a Two-Three Tree data structure, a self-balancing search tree, for efficiently storing and retrieving words along with their associated line numbers from a text document.
This is a collection of data structures I have made as I learn Computer Science
Implementação de Árvore B* / Two-three-tree, utilizada na disciplina de Estruturas de Dados SI-UFF.
Add a description, image, and links to the two-three-tree topic page so that developers can more easily learn about it.
To associate your repository with the two-three-tree topic, visit your repo's landing page and select "manage topics."