Lectures related to Fast Interval Queries

Binary Search Trees: Implementation and Operations

Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.

Data Structures: Stacks, Queues, Linked Lists

Covers stacks, queues, linked lists, and binary search trees in data structures.

Tree-Structured Indexing: B+ Trees Explained

Covers B+ Trees, a key data structure for efficient indexing in databases.

Algorithms: Final Exam Review

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

Optimal Binary Search Tree

Explores optimal binary search trees to minimize expected search cost efficiently.

Binary Search Trees: Operations and Implementations

Covers operations and implementations of binary search trees.

Dynamic Data Structures: Vectors and Linked Lists

Covers the comparison between vectors and linked lists in C++ programming.

Algorithms Exam Preparation

Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.

Binary Search Trees: Operations and Procedures

Covers operations and procedures related to binary search trees, including finding successors and predecessors.

Binary Search Trees: Operations and Implementations

Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.

Binary Search Trees Operations

Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.

Binary Search Trees: Operations and Implementations

Explores Binary Search Trees, covering operations like searching, finding min/max, successors, and printing.

Graphs: Properties and Representations

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Huffman's Algorithm: Mechanizing the Proof

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

Longest Common Subsequence and Optimal BST

Explores Longest Common Subsequence and Optimal Binary Search Trees, discussing algorithms and probabilities for efficient search structures.

Optimal Binary Search Trees

Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.

Binary trees and Catalan numbers

Covers the definition of binary trees, recursive formulas, and generating functions for Catalan numbers.

Two-Phase Construction: Arrays & Hash Tables

Explains two-phase construction for arrays, hash tables, and search trees in parallel.

Optimal Binary Search Trees

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

Encoder and Decoder for Prefix-Free Codes

Covers the implementation and verification of encoder and decoder for prefix-free codes, including classes and types, lemmas on trees, and the main theorem.