Splay tree

Related lectures (25)

Page 2 of 3

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

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

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

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

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

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

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

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

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

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