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 implementations of binary search trees, including tree search, finding minimum and maximum values, determining successors and predecessors, printing the tree in different orders, and modifying the tree through insertion and deletion.