I've got this question that asks me to make changes to the 2-3 trees that would make it possible to do a find(x) function that would find x with O(log(rank(x))) .
**rank(x) is x's index in a sorted sequence of all of the values of the tree. However we have to still do insert(x) and delete(x) with O(log(n)).
So I thought of using pointers, that would make it easier to find the wanted value and yet I have no Idea how to do it with the requested time complexity.
If you have an idea that may direct me to the solution , please share it.