I was curious to see how the 'search' operation for a red-black tree exactly works and how does it take O(logn)? I know a red-black tree takes O(logn) recolorings and O(1) rotations, but I was specifically interested in a good description of its search operation.

Thank you!