Lectures related to Binary Search Trees: Operations and Implementations

Algorithmic Paradigms for Dynamic Graph Problems

Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.

Optimal Binary Search Tree

Explores optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.

Recursion and Binary Search

Introduces recursion and binary search algorithms for efficient problem-solving.

Binary Search Algorithm

Explores the binary search algorithm's efficiency in reducing search time.

Recursive Algorithms: Induction and Recursion

Introduces recursive algorithms for factorial, exponentiation, and search.