Some Data Structure to insert and search key/values; more to come
Tags: B+-Tree in C++ , AVL Tree in C++
make
make run
make cleanno. of nodes = 1000000
order of B+-tree = 50
size of hash = 101
Converted all data structures .cpp to header files located in ./dictionary directory and also a driver .cpp file.
Compiling and running instructions are same.
Hash data structure just contain hashmap with each node pointing to a B+tree, AVLtree or RBtree. This is done to reduce insert and search time. AVL Tree:
- insert
- search
- inorder traversal
- preorder traversal
- level oreder traversal
- insert
- search
- inorder traversal
- preorder traversal
- level oreder traversal
- insert
- search
- inorder traversal
- preorder traversal
- level oreder traversal
- insert
- search
- inorder traversal
- preorder traversal
- level oreder traversal
- Optimize Code for minimum space requirement for all data structure: convert deep copy to shallow copy