Lectures related to Binary Search Trees: Operations and Implementations

Optimal Binary Search Trees Log in to Mediaspace to watch this video

Explores optimal binary search trees to minimize search cost using dynamic programming and recursive formulations.

Fast Interval Queries Log in to Mediaspace to watch this video

Focuses on designing a data structure for fast interval queries on a complete binary tree.

Algorithms: Final Exam Review Log in to Mediaspace to watch this video

Provides a detailed review of the 2016 final exam, covering various algorithmic problems.

Huffman's Algorithm: Mechanizing the Proof Log in to Mediaspace to watch this video

Explores the mechanization of Huffman's algorithm proof and functional implementation.

Binary Search: Logarithm Function Log in to Mediaspace to watch this video

Explains binary search, the logarithm function, and recursive algorithms for factorial and Fibonacci sequences.

Algorithmic Paradigms for Dynamic Graph Problems Log in to Mediaspace to watch this video

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