If the element exists, finds its leftmost index

If it doesn’t exist, locates the index of where it should be

O(log n)