Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Self-balancing binary search tree

Related lectures (26)

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.

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.

Binary Search Trees: Operations and Procedures Log in to Mediaspace to watch this video

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

Binary Search Trees: Operations and Implementations Log in to Mediaspace to watch this video

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

Encoder and Decoder for Prefix-Free Codes Log in to Mediaspace to watch this video

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

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.