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 operations and procedures related to binary search trees, including finding successors and predecessors, printing the tree in different orders, insertion, deletion, and efficient procedures to keep the tree balanced, such as AVL trees and red-black trees.
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