Lectures related to Binary trees and Catalan numbers

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

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.

Dynamic Programming: Palindromic Subsequences

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.

Data Compression: Source Coding

Covers data compression techniques, including source coding and unique decodability concepts.

Binary Search Algorithm

Explains the binary search algorithm using two pointers to efficiently search a sorted list.

Memory Design: Column Multiplexers

Delves into memory design, specifically column multiplexers and DRAM cell structures.