title: std::map and binary search tree
body: <p>I have read that std map is implemented using binary search tree data structure.</p>
  
  <p>BST is a sequential data structure (like elements in an array) which stores elements in a BST node and maintains elements in their order. For e.g. if element is less than node, store it in left of node and if it is larger than node, store it in right of node. With this approach, we achieve O(log n) complexity for various operations like search, insert etc.</p>
  
  <p>However, std map is an associate container. We have a key and a value pair to insert. Is it really implemented using BST and, if yes, how? In BST, we don't have any key or value. It is a kind of standard container.</p>
  
  <p>I am little confused. Please help me in providing clarification. Its not affecting my work but I want to understand them better. Thanks for your help.</p>