I need to have a c++ b-tree implemented. Not a b+ tree. The BTree class will use the BNode class and will have the following methods:
Insert
Delete
Find
Print (Level order)
The tree will NOT insert values if it is a duplicate.
The insert and delete must use recursion and send an enumerated status value up each level based on whether the insertion/deletion was successful.
The program will take the following command line arguments:
L: {filename} //Loads a file directory and inserts values into BTree
A: {key} //Adds this particular key to the BTree
D: {key} //Deletes this key
S: {key} //returns true or false
P: //prints level order
T: //Terminates program