Lecture

Data Structures: Stacks, Queues, Linked Lists

In course

Commodo excepteur commodo labore irure anim aute ipsum quis irure officia consectetur anim. Dolor nisi fugiat ut adipisicing excepteur aliqua in. Aliquip velit nostrud id ipsum occaecat quis enim ipsum eu enim dolor irure consectetur. Et adipisicing magna nulla sit in in occaecat esse consectetur. Culpa cillum labore exercitation laborum minim amet nulla cillum laboris voluptate aliqua fugiat exercitation.

Description

This lecture covers the implementation of stacks, emphasizing the use of delimiters in expressions. It then delves into queues, detailing insertion and deletion operations. Finally, it explores linked lists, focusing on searching, inserting, and deleting elements, along with the concept of sentinels. The lecture concludes with a discussion on binary search trees, highlighting key properties and querying operations.

Instructors (2)

deserunt ipsum labore et

Esse aute elit esse mollit ad mollit. Consectetur in qui eu fugiat. Ex in nostrud aliquip nulla nulla quis enim. Excepteur voluptate consectetur sunt ipsum enim consectetur est ea aliquip quis proident velit fugiat. Ut tempor consectetur eiusmod Lorem ut nostrud amet. In eu deserunt qui irure ea dolore sunt magna non nulla quis sunt nisi cillum.

dolore exercitation velit

Non in minim occaecat adipisicing laboris occaecat fugiat deserunt ut minim. Deserunt labore ut culpa nulla ad irure. Adipisicing tempor consequat voluptate sit ut ea labore. Aliquip et pariatur deserunt ad pariatur reprehenderit in. Tempor ea amet deserunt cillum do. Lorem ipsum pariatur ut proident. Elit sunt qui sunt non laborum irure adipisicing culpa in occaecat minim laboris.

Official source

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

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

Programming language theory: High-level programming languages

Related lectures (34)

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.