linked list (nodes connected by pointers) stores elements in nodes with pointers to the next node, enabling insertion and deletion at known positions. You use it when frequent insertions/deletions in the middle are needed or when implementing other data structures. Traversal is since there's no random access.
You'll see this in list manipulation and pointer technique problems. If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.
