Data Structures: Stacks, Queues, Linked Lists

Related lectures (25)

Page 1 of 3

Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.

Covers the comparison between vectors and linked lists in C++ programming.

Provides a detailed review of the 2016 final exam, covering various algorithmic problems.

Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.

Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.

Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.

Covers stacks, queues, and linked lists, emphasizing efficiency and dynamic structures.

Explores optimal binary search trees to minimize expected search cost efficiently.

Covers B+ Trees, a key data structure for efficient indexing in databases.

Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.