Login to filter by course Login to filter by course Reset
Focuses on designing a data structure for fast interval queries on a complete binary tree.
Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.
Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample 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 optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.
