Parent pointers make some btree operations simpler to implement, but they result in a lot more buckets being written when there is a split / merge. Some operations (hops from one node to another bypassing the root) are faster with parent pointers, but in these cases we may be able to cache the pointers from the time we last descended the tree and only invalidate the cache if we yield.