Deleting a particular key (5), then search's for it get stuck in infinite loop.
BPlusTree tree(3);
tree.insert(5);
tree.insert(3);
tree.insert(8);
tree.insert(69);
tree.insert(10);
tree.insert(12);
tree.insert(22);
tree.insert(72);
tree.insert(39);
tree.bpt_print();
assert(tree.search(5));
assert(tree.search(3));
assert(tree.search(8));
assert(tree.search(4) == false);
// Test delete
tree.remove(5);
assert(tree.search(5) == false);
printf("HERE 1\n");
assert(tree.search(3));
assert(tree.search(8));
Deleting a particular key (5), then search's for it get stuck in infinite loop.
BPlusTree tree(3);
tree.insert(5);
tree.insert(3);
tree.insert(8);
tree.insert(69);
tree.insert(10);
tree.insert(12);
tree.insert(22);
tree.insert(72);
tree.insert(39);
tree.bpt_print();
assert(tree.search(5));
assert(tree.search(3));
assert(tree.search(8));
assert(tree.search(4) == false);
// Test delete
tree.remove(5);
assert(tree.search(5) == false);
printf("HERE 1\n");
assert(tree.search(3));
assert(tree.search(8));