Your code is a DECLARATION, not a DEFINITION. It declares how something would look, if you created one. It doesn't actually create anything. All it does is provide some information for the compiler, should it need it later. You only need to tell the compiler once. It remembers after that.
And linked lists are NOT tables. Tables are consecutive pieces of information, stored next to each other in memory. A linked list is a simple, linear list of disconnected items which are usually NOT anywhere near each other. Which is WHY they have to have a pointer of some kind included with each "value." That "next" pointer is used to find a distant, assumed not adjacent, next item.
You usually use linked lists if you don't create new items all at once. So if you already know you need a 3x3 of something, there really is no need for a linked list to make that. You just create it either by a definition saying so, or by using an appropriate malloc() function call and then appropriate indexing into that block of memory of adjacent items.
Technically, using two pointers in each node, I suppose you _could_ create a 3x3 matrix once element at a time, if you set up the pair of linked list pointers (or two pairs, if doubly linked) to point to the right elements in the matrix. But I can't recall ever seeing that done, in practice. It's "insane" to imagine doing things that way... well, unless you wanted to support grossly sparse matrices (which a 3x3 would be silly bothering with.)
You need to spend some time trying to understand WHY linked lists are useful, at times, and actually WHAT your structure MEANS. It's not just some STAMPED OUT template that you learn to recognize like ornate bookends. You need to understand WHY these bookends are used, at all (bookends are used to keep the books upright, for example, and that is desirable for WHAT reason exactly?)
I suspect you don't really understand them at all, yet. You have ONLY learned how to spot the idiom. But you don't have any idea why anyone bothers with it. You need to understand that part.