Binary search tree is one of the most important data structures in program design. This article proposes a novel lock-free … algorithm, which can implement the lock-free operations, such as search, insert and delete, using compare and swap (CAS). Unlike … operations by considering of the subtree. This article presents the details of the lock-free algorithm, which can effectively …