Now that we have learned a few things about Data

Structures and Algorithms lets discuss Hash Tables, Trees and Sets. Here is what I would like you to do:

First, Examine the comic and caption. Explain how it relates to the material thus far.

Next, let's delve a little deeper and further discuss Hash Table, Trees and Sets.

Give an example of each of these types of data structures and an example of where you might use each one.

Comment on each other's examples throughout the discussion activity.

Lastly, answer these questions as you give examples "Not only is that terrible in general, but you just KNOW Billy's going to open the root present first, and then everyone will have to wait while the heap is rebuilt." By$,$ Randall Munroe $-$ Tree. Creative

Commons Attribution$-$NonCommercial $2\mathrm{.}5$ License. and comment on each others posts.

What Data structures would work best? Why?

What Algorithms? Why?

What are some of the considerations that should be taken into account?

Tradeoffs between one approach compared to another?