Less common than arrays but still appear in interviews.
Linked Lists: Nodes pointing to next node. time insert/delete with reference, time to find, space total. Know: reversal, cycle detection, merging.
Stacks: Last-In-First-Out (LIFO). time push/pop, space. Know: parentheses matching, expression evaluation.
Queues: First-In-First-Out (FIFO). enqueue/dequeue. Know: BFS implementation, task scheduling.
These are less frequently asked than arrays/strings but appear enough that you should understand them.
For deep coverage, see Sections - of the Data Structures roadmap.