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 ...

Learn when and how to use different data structures and their algorithms in your own code. This is harder as a student, as the problem assignments you'll work through just won't impart this knowledge.

Quantum Algorithms Prerequisites Undergraduate algorithms (CSCI 3104), data structures (CSCI 2270), discrete mathematics (CSCI 2824) and two semesters of calculus, or equivalents. We will assume that ...