Implementation of B-tree

Hi,

I’m looking for any informations, or links to help me about implementation of B-tree : B-tree - Wikipedia, and different functions like delete of node, insertion, search..

Best regards

I don’t have an out-of-the-box solution but the links below contain code that may be of use for the task at hand.

http://stackoverflow.com/questions/6563407/classification-tree-implementation-in-mathematica

http://stackoverflow.com/questions/6097071/tree-data-structure-in-mathematica

http://stackoverflow.com/questions/6138540/code-manipulation-via-interactive-tree-for-mathematica

http://mathematica.stackexchange.com/questions/8111/building-a-tree

http://mathematica.stackexchange.com/questions/5387/how-can-i-use-mathematicas-graph-functions-to-cheat-at-boggle/5394#5394

Thankyou very much for your attention, i will try to developp it

I have done some non-binary tree implementations used for retrieval or key-value association described here:

[Tries with frequencies for data mining | Mathematica for prediction algorithms

](Tries with frequencies for data mining | Mathematica for prediction algorithms)You can find the Mathematica code at: https://github.com/antononcube/MathematicaForPrediction/blob/master/TriesWithFrequencies.m .
In that code deletion is not implemented, and insertion is implemented through a general tree merging procedure.

Thankyou very much :slight_smile: