Lecture

Optimal Binary Search Trees

Description

This lecture covers the concept of Optimal Binary Search Trees, explaining the bottom-up approach to calculate the expected search cost. The instructor demonstrates the dynamic programming algorithm, discussing the pseudocode and runtime analysis. The lecture also includes a section on solving a midterm exam from 2016, focusing on algorithmic problem-solving strategies.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.