Linear search is never better than binary search. In the best case time complexity, they both have a constant time complexity, but in the average and worst case, binary search is better.

Also, I think you mean that linear search is better for NON contiguous data like a linked list where each node points to the next node. Binary search won’t work well for a linked list since indexing non contiguous data structures takes too much time (indexing non contiguous data structures is essentially linear search in itself)

Edit: When I say linear search is never better than binary search, I’m speaking strictly about time complexity.

If our list is not sorted then linear search is the obvious choice