Lecture

Binary Search Trees: Operations and Procedures

Description

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
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.