how it the linux implementation of double linked lists useful

[Ahmed Soliman]

while reading through linux/list.h I noticed that the linked list
structure is really simple with only pointer to the previous node and
pointer to next node with no other data (It can't handle anything
inside it ) I started to wonder how such linked list can be useful to
the kernel or (useful in general) !
thanks