No, not easily.
A linked list overcomes some of the disadvantages of arrays (and introduces its own disadvantages). In a linked list, each node consists of two items:
The picture shows the idea. Each rectangle represents a block of memory. Part of the block holds the data, and the other part holds the address of the next block of data.
The arrows represent memory addresses.
The diagonal slash in the last node stands for
the value null which is how the
last node shows that it has no successor.
In MIPS assembly (and in most other languages),
null is a word full of zero bits.
The blocks of memory (implementing nodes) need not be adjacent to each other in physical memory.