Elements of Data Structure Design in C

I have read Algorithms in C by Sedgewick and was going to start in on Intro to Algorithims by Cormen, et al however I thought I would check with you first!

Does anyone know of a good flowchart, outline or other concise resource that summarizes the major considerations of creating structures? I have read about linked lists, queues, stacks, trees, arrays, hashes, graphs, etc. There are a lot of permutations to consider for different circumstances but I have yet to find a resource that would encapsulate the core ideas in a broader spectrum to help compose better designs.

For example:

Is the data single or grouped?
Is it lexographical, chronological, numerical, etc?
What constraints are known at compile time or run time? (Array index size, maximum tree depth, maximum string length)
Is the data to be processed as inspected in real time, based on size or based on subsequent calls?

This is kind of a scatterbrained list but essentially I am looking to simplify the considerations to learn how to design a better program. Thoughts?