Standard Template Library used by STL

First, Map,set

The Set collection container implements the data structure of the balanced binary search tree of the red and black tree (red-black trees), and when the element is inserted, it automatically adjusts the arrangement of the binary tree, placing the element in the appropriate position to ensure that the key value of each subtree node is greater than the key value of all nodes of the left subtree. and the key value of all the nodes of the small less right operand subtree; Also, make sure that the height of the left subtree of the root node is equal to the height of the right subtree, so that the height of the binary tree is the smallest and thus the fastest retrieval speed. It is important to note that it does not repeatedly insert elements of the same key value and takes ignore processing. The internal structure of the Multiset (multi-collection Container), map (mapping container) and Multimap (multi-mapping container) is also a balanced binary search tree.

Standard Template Library used by STL