Binary Search Trees (BSTs): A BST is a tree-like data structure in which each node can have a maximum of two children. Binary search is fundamental to operations such as insertion, deletion, and ...

Binary Search is an algorithm that can find the index of an element in a sorted array data structure. You've likely used Binary Search it in everyday life without even realizing it.

Good candidates can arrive at the binary search tree as the right path in a few minutes, and then take 10-15 minutes working through the rest of the problem and the other roadblocks I toss out.