• Lists, Iterators, Stacks, Queues, Deques • Trees, Priority Queues, Heaps • Bubble, Insertion, and Selection Sorts • kn

[answerhappygod]

Lists Iterators Stacks Queues Deques Trees Priority Queues Heaps Bubble Insertion And Selection Sorts Kn 1 (61.85 KiB) Viewed 39 times

• Lists, Iterators, Stacks, Queues, Deques • Trees, Priority Queues, Heaps • Bubble, Insertion, and Selection Sorts • know what each data structure's operations are, which ones return values, and how to apply them • know how to apply each sort to a set of data values • how these data structures are similar, how they are different, what the advantage of each is compared to the others, and in what situations one would be better used than the other • algorithms in pseudocode for appropriate actions on each of the data structures • diagrams of stacks, queues, deques, trees, heaps o show insertion & deletion in the diagrams • it should be organized Don't write in sentences. Tables, charts, columns are all helpful.