Main Article Content
Abstract
The work is based on a new method for procuring non blocking implementation of a binary expression tree. The updates to the tree are used to modify contiguous portions of the tree atomically. We are using modified multi–word abstractions of typical LL, VL and SC elementary which in turn are executed from single-word CAS which is supported by both Intel 64 and AMD64 modern processors.We provide an approach suited for creation of binary expression tree whose pseudocode is given and it can be implemented in any programming language such as C++. This approach yields an effective and easy procedure for generation and traversal of the said data structure. The resultant implementation is free from the disadvantages of implementations obtained by using customary techniques such as locks and CAS.