Add backoff logic to the btree delete and walk yield loops

The loops assume that pages will change state quickly, so busy waiting is reasonable. We've seen cases in other parts of the code where that isn't the case - we should add backoff to the yield loops, to avoid saturating CPU with busy waiting if page state transitions take longer than expected.