full implementation of b+ tree
<p>I am looking for an implementation of b+ tree in java. Does anyone know where I can find the proper and full implementation? When I say proper - I mean that each inner node must have at least N/2 to N children and each leaf must have between M/2 to M records. 
I have the following link <a href="http://en.wikibooks.org/wiki/Transwi...tation_In_Java" rel="nofollow">http://en.wikibooks.org/wiki/Transwi...tation_In_Java</a> but it is not enough. I dont think the code takes into account that the tree has to be constantly balanced and that each inner node must have more than N/2 children. I dont know how to add that to the code. 
Any suggestions???</p>

<p>Thank you</p>
