C++ STL and binary search trees

• The C++ Standard Template Library provides these containers (i.e., data structures):
  

			vector	

			deque	

			list	

			stack	

			queue	

			priority_queue	

			set	

			multiset	

			map	

			multimap	

			bitset

• Of these, set is one that is implemented using a balanced binary search tree (typically a red-black tree)
  
• Let’s look at some aspects of the interface of set and consider issues in implementing it