BTree Implementation

[fam2315]

Can someone point me to an example of a BTree in Java. I particularly need to see how a deletion works so that I can put println statements in and see how the code works.

[Junky]

Oh no Google is broken again.

[JeffGrigg]

Here's a good place to look:
Let me google that for you

[fam2315]

I couldn't locate an example, so I figured someone in this forum may be aware of one.

[fam2315]

14 posts and you feel the need to play that role...

I've tried google and I can't seem to find an example of a delete.

[Junky]

I couldn't locate an example.

What the hell did you use as a search term? "soggy blancmange"

I tried "java btree" and got plenty of examples.

[JeffGrigg]

OK, here's a description of how to delete a node in a binary tree:
Binary search tree - Wikipedia, the free encyclopedia

Yes, it is a bit tricky.

[JosAH]

OK, here's a description of how to delete a node in a binary tree:
Binary search tree - Wikipedia, the free encyclopedia

Yes, it is a bit tricky.

I don't think that's what the OP means; a binary tree isn't a Btree (as in Btree, B+tree and B*tree). Deleting a node from a BTree can be tricky indeed by not for the reasons outlined in that wiki article. Basically you have to delete the element from a node and when the node becomes too small you borrow an element from the parent and join the node with one of its neighbours; apply recursively to the parent node etc.

kind regards,

Jos