Lecture
Optimal Binary Search Tree
In course
DEMO: occaecat sunt sit dolore
Magna id ut qui ex aute culpa nisi dolore dolore et do aliqua. Enim consectetur consectetur anim mollit mollit. Fugiat ullamco velit minim amet et tempor. Mollit aliqua Lorem in deserunt eu. Ut veniam cupidatat amet dolor consectetur amet magna. Excepteur minim Lorem nulla esse irure eiusmod incididunt aliqua exercitation.
Description
This lecture covers the concept of optimal binary search trees, where a binary search tree is built from a sequence of distinct keys with associated probabilities to minimize the expected search cost. The lecture explains the process of building optimal binary search trees, the considerations for selecting roots, and the recursive formulation for calculating the expected search cost. Examples and observations are provided to illustrate the concepts discussed, emphasizing the importance of optimal substructure and bottom-up approach in constructing efficient binary search trees.
Official source
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.