Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.

While they do a great job when working with regular data types, they are not very efficient when dealing with binary data, for example images or documents.

So the fitting effect of MIVM is better than that of the regular solution model in binary solid alloys.