title: C/C++: How to store data in a file in B tree
body: <p>It appears to me that one way of storing data in a B-tree as a file can be done efficiently with C using binary file with a sequence (array) of structs, with each struct representing a node. One can thus connect the individual nodes with approach that will be similar to creating linked lists using arrays. But then the problem that props up would be deletion of a node, as erasing only a few bytes in the middle in a huge file is not possible.</p>
  
  <p>One way of deleting could be to keep track of 'empty' nodes until a threshold cutoff is reached and then make another file that will discard the empty nodes. But this is tedious.</p>
  
  <p>Is there a better approach from the simplicity/efficiency point of view for deleting, or even representing a B-tree in a file?</p>
  
  <p>TIA,
  -Sviiya</p>