Merge two leaf pages by moving all tuples from the right page to the left page. Delete the corresponding key and right child pointer from the parent, and recursively handle the case when the parent gets below minimum occupancy. Update sibling pointers as needed, and make the right page available for
(TransactionId tid, HashMap<PageId, Page> dirtypages, BTreeLeafPage leftPage, BTreeLeafPage rightPage, BTreeInternalPage parent, BTreeEntry parentEntry)
source not stored for this graph (policy: none)
no outgoing calls