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

Concept

Splay tree

Related lectures (25)

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.

Data Structures: Stacks, Queues, Linked Lists

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

Binary Search Trees Operations

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

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 Implementations

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

Class Hierarchies

Covers abstract classes, class extensions, object definitions, companion objects, and dynamic binding in Scala.

Two-Phase Construction: Arrays & Hash Tables

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

Data Compression: Source Coding

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

Optimal Binary Search Tree

Explores optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.

Dynamic Data Structures: Vectors and Linked Lists

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

Binary trees and Catalan numbers

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

Dynamic Programming: Palindromic Subsequences

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

Graphs: Properties and Representations

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

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.

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.

Longest Common Subsequence and Optimal BST Log in to Mediaspace to watch this video

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

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

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

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

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

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.