Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the design of a data structure for fast interval queries on a complete binary tree, focusing on storing extra information at each node to efficiently compute max values within a given interval. The instructor explains the preparation of the data structure in O(n) time and the query answering process in O(log n) time, ensuring optimal performance.
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