Abstract
The Standard Template Library (STL) is a C++ library that provides a set of well structured generic C++ components that work together. Based on its well-structured design, STL can be extended by adding new generic algorithms or new generic containers. In this paper, the work on extending STL by adding several efficient container classes for threaded binary search trees is discussed. It is shown that the addition of threads significantly increases the efficiency of some important access operations on the binary tree containers. In general, significant gain in efficiency can be expected in situations where the data structures are relatively stable, that is, the data structures are looked up often but modified little.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
