Map, Hash tables, AVL trees

PART 1

• Discuss about what methodology you would like to use for hashing in terms of chaining or linear probing or double hashing to avoid any collision. 
• Why do you think Skip Lists work against all our conventional thoughts about randomly choosing something from the random number generator? 
• Can you describe the essence of Merge-sort? In what circumstances, it would work the best?

PART 2

• 1) AVL Trees
• 2) Heaps
• 3) The difference between the Depth-First Search (DFS) and the Breadth-First Search (BFS) in Graph Traversals

400 words

4 sources 

Due ASAP