Red-Black Tree Example:

Time Complexities

N = Number of Nodes

• Search: O(log(N))
• Insertion: O(log(N))
• Deletion: O(log(N))

More Information