🌲 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)
data-structures
tree-search
two-three-tree
balanced-trees
b-tree
balanced-search-trees
datastorage
2-3-tree
two-three-trees
tree-data-structure
open-source-code
free-to-use
tree-datastructures
split-operations
rotations-operations
datastructures-tasks
insert-delete-operations
-
Updated
Jan 17, 2021 - C++