Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. Many different relaxed balancing algorithms have been proposed, especially for red-black trees and AVL trees, but their performance in concurrent environments is not yet well understood. This paper presents an experimental comparison of the strictly balanced red-black tree and three relaxed balancing algorithms for red-black trees using the simulation of a multi-processor machine.