What is a more efficient implementation of a linked list?

There are at least two ways to present a linked list:

1.) Using representations based on an array of a linked list, where we save std::vectorstructures of type

struct {
    <whatever-type-you-want> item ;
     int   nextitem; 
   }

Here, inserting into the list, does push_back () on the vector and gives the corresponding value for the next element.

2), in which you have a set of structures throughout RAM. Here the insertion is done using C ++ operators new.

Is it right to say that the first method is more efficient, since all elements are in sequential places in memory, because of which it would be possible to create a linked list to a much larger size than the second method

In the second method, there may be memory fragmentation with huge linked lists, due to which it was previously possible to get a segmentation error.