https://github.com/harismuneer/2-3-tree

🌲 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)
https://github.com/harismuneer/2-3-tree

2-3-tree b-tree balanced-search-trees balanced-trees data-structures datastorage datastructures-tasks free-to-use insert-delete-operations open-source-code rotations-operations split-operations tree-data-structure tree-datastructures tree-search two-three-tree two-three-trees

Last synced: 5 days ago
JSON representation

🌲 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)

• Host: GitHub
• URL: https://github.com/harismuneer/2-3-tree
• Owner: harismuneer
• License: mit
• Created: 2018-06-29T18:42:39.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2021-01-17T17:42:44.000Z (almost 4 years ago)
• Last Synced: 2023-03-04T19:50:36.481Z (over 1 year ago)
• Topics: 2-3-tree, b-tree, balanced-search-trees, balanced-trees, data-structures, datastorage, datastructures-tasks, free-to-use, insert-delete-operations, open-source-code, rotations-operations, split-operations, tree-data-structure, tree-datastructures, tree-search, two-three-tree, two-three-trees
• Language: C++
• Homepage: https://github.com/harismuneer
• Size: 26.4 KB
• Stars: 10
• Watchers: 3
• Forks: 17
• Open Issues: 2

Awesome Lists containing this project