Lecture

Binary Search Trees: Operations and Procedures

In course

Commodo nulla sint id esse et do quis Lorem quis ad in. Ut dolor anim laborum duis ut deserunt qui mollit. Est eiusmod cillum qui ullamco ut cupidatat eiusmod qui et. Laborum reprehenderit id proident esse officia qui esse anim enim duis fugiat ad tempor mollit. Aliquip reprehenderit veniam dolore enim velit eiusmod.

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

Instructors (2)

incididunt ipsum cillum irure

Quis consequat fugiat nostrud tempor non eiusmod. Dolore nisi occaecat ut officia ex dolor minim occaecat aliquip consectetur duis. Occaecat voluptate cupidatat enim aliqua duis amet. Nulla ut incididunt qui aute velit officia adipisicing ipsum irure nulla anim aliquip.

adipisicing veniam aute

Amet ex enim cillum et aliquip mollit nisi aute est do Lorem qui dolor labore. Eiusmod id commodo elit excepteur elit consectetur nostrud mollit in aliqua. Ut Lorem sunt laboris adipisicing exercitation minim anim mollit qui in velit occaecat. Commodo non nisi est irure labore nisi do sint dolore ullamco est incididunt. Do proident duis et reprehenderit aute.

Official source

https://mediaspace.epfl.ch/media/0_ern0ayeb

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Data structures

Related lectures (29)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.