Split a leaf page to make room for new tuples and recursively split the parent node as needed to accommodate a new entry. The new entry should have a key matching the key field of the first tuple in the right-hand page (the key is "copied up"), and child pointers pointing to the two leaf pages resul
(TransactionId tid, HashMap<PageId, Page> dirtypages, BTreeLeafPage page, Field field)
source not stored for this graph (policy: none)
no outgoing calls