Hi,
I have implemented a B-Tree(not binary tree)... Now the Deletion part.. there seem to be a lot of methods in deleting an element from a B-Tree and still keep the tree balanced... Which is the easiest method to implement...
And please explain the method you choose.. along with reason if you could...
Thanx
Vasanth