Lectures related to Treap | EPFL Graph Search

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

Explores binary search fundamentals, efficiency, and temporal complexity in algorithmic searching.

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.

Algorithms Exam Preparation

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

Data Structures: Stacks, Queues, Linked Lists

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

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.

Binary Search Trees: Operations and Implementations

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

Binary Search Algorithm

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

Algorithms: Final Exam Review

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

Recursive Algorithms: Induction and Recursion

Introduces recursive algorithms for factorial, exponentiation, and search.

Recursion and Binary Search

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

Binary Search: Logarithm Function

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

Optimal Binary Search Trees

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

Binary trees and Catalan numbers

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

Binary Search Trees: Operations and Procedures

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

Binary Search Algorithm

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

Binary Search: Implementation and Example

Covers the binary search algorithm and provides a step-by-step example.

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.

Huffman's Algorithm: Mechanizing the Proof

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