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

Basic data structures: Heaps, and Binary Search Trees. Algorithm Design Approaches: Divide and Conquer including analysis using recurrences; Greedy Algorithms; Dynamic Programming Algorithms; ...