I don't think thats the right solution for me. I am saving the tree to the disk because it is very big and I need to access the nodes with minimu disk block read operations. By serealising the tree to a file I will need to read the whole file in order to get just a few nodes, and this is really slow.

I understand how to create a B-tree, insert data into it and all other tree operations. But when I am trying to save (serialize) the tree to a physical media (disk) I don't know how to do it.
1. In order to do it in an efficient way I have to save the tree node on one disk block (only one disk access).
2. One vertice, that points to a child node, has to represent the address to an other block.
The question is: how I can save...