Consider the following:

In C++, the std::unordered_map uses a hash function in the insertion process to determine where the new inserted element will be located.

However, the std::map does not use a hash function in the insertion process and determines the location of the new inserted element using the same method that is used to determine the location of the new inserted element in any binary search tree. By this, I mean the method by which the location of the new element is determined in any binary search tree is for example, if the element is greater than the current element then go right, or if it is less than the current element then go left.

Is my conclusion 100% accurate?