I one time took a class that introduced every linked data structure (lists, trees, stacks, queues, etc) with statically allocated arrays. Only later did they show the dynamic memory implementations. I thought it was a bit weird at the time, but now I guess it was to get students to focus on the data structure, instead of worry about pointers.
It's easy to write a linked list in FORTRAN-77, using an array as the underlying storage - I've done it several times.