Basic data structures: Heaps, and Binary Search Trees. Algorithm Design Approaches: Divide and Conquer including analysis using recurrences; Greedy Algorithms; Dynamic Programming Algorithms; ...

Also, the more memory a data structure uses, the less CPU time associated algorithms will need to process the data items–leading to faster algorithm results. As much as possible, you should ...