SUGGESTED B+Tree INSERTION ALGORITHM:
adatdi 

** B+ Nodes maintain n-1 key values and n pointers

1. 	Find the leaf page in which the insertion should
	take place.

2.	If there is space, put the new key in, rearrange 
	keys and terminate.

3. 	If there is no space for the newly arrived record,
	then allocate a new leaf node.
	Split the records between the two nodes.
	ceil[(n)/2] records go to the first block
	and the remaining in the second.
	Propagate upwards the first value (key) of the 
	second block.

4. 	If insertion in the internal node is possible
		then do the insertion (of the propagated key)
		arrange the pointers properly and terminate.
	Otherwise	
		the internal node needs to be split.
		Acquire a new block. All the keys less 
		than the median go to the first block
		and all the keys greater than the median
		go to the second.
		Rearrange and keep track of pointers properly.
		The median needs to be up-propagated
		Goto to 4.