Lock-free BSTs or b-trees exist only in research papers, but lock-free skiplists are straightforward to implement.
Mainly functional paradigm languages disagree with this.
Mainly functional paradigm languages disagree with this.