Binary/2-3 Tree help

15. Consider a binary or 2-3 tree. We want an extra operation "block less-than delete": given z, this operation should delete all keys at most x. Design an efficient algorithm for this problem. You are allowed to augment your tree with extra O(1) information per node