Which operation is guaranteed to take O(log n) time in a Red-Black tree?

Which operation is guaranteed to take O(log n) time in a Red-Black tree?

Step 1: Understand what a Red-Black tree is. It is a type of self-balancing binary search tree.
Step 2: Know that in a binary search tree, the time complexity for operations like insertion, deletion, and search depends on the height of the tree.
Step 3: Realize that a Red-Black tree maintains a balanced height, which is always O(log n), where n is the number of nodes in the tree.
Step 4: Learn that because of this balanced height, all operations (insertion, deletion, and search) will take O(log n) time.
Step 5: Conclude that in a Red-Black tree, all three operations are guaranteed to take O(log n) time.

No concepts available.