To insert a node

1. Find a leaf to store it, and add it to the leaf
   • To find leaf, follow a child (if any) whose bounding box contains bounding box of data item, else child whose overlap with data item bounding box is maximum
2. Handle overflows (here by overflow we mean if no of objects/rectangles inside given region increases two much) by splits. We may need to divide entries of an overfull node into two sets such that the bounding boxes have minimum total area .