Well, a singly linked list is actually one of the most important data structure I've found :).

From there, one can modify it to implement tries.

And then one can understand trees, arborescences etc.

The rest is about algorithmic complexity (speed and size) which I never remember but that's easy to look it up.

It's true that someone who does simple frontend engineering (for example) might not need to know too much about that.

But for instance, it was just a couple weeks ago that I've realized a markov chain is just a bunch of linked lists (a DAG, Directed Acyclic Graph).

I've found Computer Science to be a very nice framework to think about the world.