Store the BTree to the disk

[abdullahemad12]

Task

Store the B-tree to a binary file on the hard disk with its corresponding objects if necessary.

Binary file format:

Header:

bits 0 - 7: identifier (magic number)
bits 8-39: length
bits 40 - 71: max_key
bits 72 - 103: min_key
bits 104-135: n

File Format and algorithm:

• 8 bits: node identifier (just a number to identify that we are reading a node)
• 32 bits: len
• store n entries:
  for each entry store the key and call a function given by the user on the object pointer to store it.
  Note: reserve 32 bits for the size of the object before calling the message and calculate the seek to get the size of the object.

repeat this for all the children of the node