Is there another type of list than arraylist and linked-list?
Yes, there are many types of lists depending on the arrangement of objects and the complexity of different types of operations. For example:

Binary Tree or d-ary tree is a hierarchical structure that stores nodes in the form of parent and child nodes.

Directed or Undirected Graph can be represented using adjacency list data structure which represents all possible connections between a set of objects. In other words, it is an array of lists.

Doubly Connected Edge List is used for performing fast operations on planar graphs and 3-dimensional polytopes.

Skip List is a randomized data structure that provides $O(\log n)$ insertion in a linked list


Likewise, you can even design your own data-structure based on different requirements. It is all about how you arrange and connect the objects.