How to apply algorithmic design and data structure techniques in developing structured programs is solved by finding which one is needed for the specific problem that is being solved because there are a lot of different ones.
An example of this is if elements have greater value or lesser value the element has to be searched and the binary tree has to be used and stack or queue is not.
But there are data structures that can be used that will make it less space to store if it is needed to not take up much space. This will be useful if there is only a limited number of spaces given to use up.
Are some algorithms and data structure designs better than others?
Every program has specifics they need to run off of. So before it's figured out which one is better come up with a design strategy. It can be figured out with this design strategy what's the better one for the program you are making. Choosing between the top-down or bottom-up approach is the right way to apply which one is needed. Make sure not to forget to take the execution time in the process of deciding how much it will be to store it because these are important in choosing which ones will be best to use.
