How do different data structures compare in C?

What are the main differences between arrays and linked lists in C?

Arrays have a fixed size and allow random access, while linked lists are dynamic and allow efficient insertions/deletions.

Can you explain when to use a stack over a queue?

Use a stack for LIFO operations like backtracking, and a queue for FIFO operations like scheduling tasks.

What about hash tables? How do they compare to arrays?

Hash tables provide faster lookups on average compared to arrays, but they require more memory and can have collisions.

Are there any performance considerations I should keep in mind?

Yes, consider time complexity for operations like insertion, deletion, and access, as well as memory usage.