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.
Binary Search Trees: Operations and Implementations
This lecture covers the key properties of Binary Search Trees, including the rules for left and right subtrees, tree height, and operations like searching, finding minimum and maximum values, determining successors and predecessors, and printing the tree in different orders. It also delves into modifying a Binary Search Tree through insertion and deletion, explaining the concepts and implementation details for each operation.
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