Which property of merge sort makes it suitable for linked lists?
Merge sort suits linked lists because: 1) Relies on sequential access patterns, 2) Doesn't require random access to elements, 3) Natural division of linked lists at midpoint, 4) Efficient merging of sequential data, 5) No need for extra array allocation, 6) Works well with pointer-based structures, 7) Maintains stable sorting characteristic, 8) Optimal for linked data structures.