title: Binary Search Tree Implementation in C++ STL?
body: <p>Do you know, please, if <strong>C++ STL</strong> contains a <strong>Binary Search Tree (BST)</strong> implementation, or if I should construct my own BST object?</p>
  
  <p>In case STL conains no implementation of BST, are there any libraries available?</p>
  
  <p><strong>My goal</strong> is to be able to find the desired record as quickly as possible: I have a list of records (it should not be more few thousands.), and I do a per-frame (its a computer game) search in that list. I use unsigned int as an identifier of the record of my interest. Whatever way is the fastest will work best for me.</p>