Concept

Linked list

Related lectures (27)

Data Structures: Stacks, Queues, Linked Lists

Covers stacks, queues, linked lists, and binary search trees in data structures.

Elementary Data Structures: Stacks, Queues, Linked Lists

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

Abstract Data Structures and Standard Libraries

Covers abstract data structures and the C++ standard library, including linked lists, stacks, queues, and complex numbers.

Binary Search Trees: Implementation and Operations

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

Dynamic Data Structures: Vectors and Linked Lists

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

Generics and Subtyping

Covers advanced concepts in generics and subtyping in Java, focusing on LinkedList implementation and List interface.

Universal Constructions: Linked Lists

Covers the universal constructions of log objects using linked lists and the challenges of implementation.

Implementation of Singly Linked Lists

Covers the implementation of singly linked lists in Java, focusing on concepts such as nodes, size management, adding, removing, and getting elements.

Synthesis of Safe Pointer-Manipulating Programs

Introduces SuSLik, a program synthesizer generating safe low-level programs from logical specifications, showcasing its capabilities in handling linked data structures.

Linked Lists: Implementation and Iteration

Covers the implementation of linked lists in Java, focusing on operations and testing.

MIPS Assembly: Function Calls & Memory Management

Explores MIPS assembly language, covering function calls, memory management, and data structures, including recursive functions, programming constructs, arrays, and linked lists.

Polymorphism and Proofs

Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.

Implementing Combiners

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

C++ Standard Library: Tools Overview

Covers the main tools in the C++ standard library, emphasizing their importance for efficient programming.

Union-Find and Minimum Spanning Trees

Covers the Union-Find data structure and Minimum Spanning Trees.

Collections: Introduction

Covers the basics of collections in Java, including sets, keys, values, duplicates, order, and access methods.

Hash Tables Analysis

Covers the analysis of hash tables, including search operations and expected collisions.

Pointers and Arrays: Understanding sizeof in C

Explains the sizeof operator in C, focusing on its use with pointers and arrays, and highlights common pitfalls and errors in its application.

Pointers and Arrays: Memory Management in C

Explains the relationship between pointers and arrays in C, focusing on memory management and pointer arithmetic.

Implementation of Sets: Part I

Covers the implementation of inheritable classes for simplified sets in Java.