Implementation of Bplus tree in JAVA with following operations:
- Initialize (m): create a new m-way B+ tree
- Insert (key, value)
- Delete (key)
- Search (key): returns the value associated with the key
- Search (key1, key2): returns values such that in the range key1 <= key <= key2