Is it the same as find minimum for a binary search tree? I know recoloring runs in O(logn) and rotations are O(1).
Even if we are wanting it to find the 'k-th' smallest key in the red-black tree.
Could someone help me understand it in more detail? Thank you!