Overview of Trees, including depth first search (DFS), breadth first search (BFS), Binary Search Trees & Self Balancing Trees.
In Part 1 of this series I looked at common search and sorting algorithms used
on Lists [https://blog.monkey.codes/tech-interview-cheatsheet-lists-search-sort/]. This post
will look at Hash functions and how they are applied to Sets and Maps to offer
constant time lookup performance.
An overview of Binary Search algorithms, including Bubble, Merge and Quick Sort.
An example of how to analyze the running time of a divide and conquer algorithm like merge sort.