linguistic:voice_change, structural:summarization, information:filtering
Parallel algorithms

Parallel algorithms for constructing red–black trees from sorted lists of items can run in constant time or O (log log n) {\displaystyle O(\log \log n)} time, depending on the computer model, if the number of processors available is asymptotically proportional to the number n {\displaystyle n} of items where n → ∞ {\displaystyle n\to \infty }. Fast search, insertion, and deletion parallel algorithms are also known.

The join-based algorithms for red–black trees are parallel for bulk operations, including union, intersection, construction, filter, map-reduce, and so on.