Merge two internal pages by moving all entries from the right page to the left page and "pulling down" the corresponding key from the parent entry. Delete the corresponding key and right child pointer from the parent, and recursively handle the case when the parent gets below minimum occupancy. Upda
(TransactionId tid, HashMap<PageId, Page> dirtypages, BTreeInternalPage leftPage, BTreeInternalPage rightPage, BTreeInternalPage parent, BTreeEntry parentEntry)
source not stored for this graph (policy: none)
no outgoing calls