Introduction to Linked Lists
Channel:
Subscribers:
2,640
Published on ● Video Link: https://www.youtube.com/watch?v=Ietvbn5vAbk
Today we had our first lecture on how to make a Linked List, which is one of the basic data structures all computer scientists need to know.
They involve new, delete, and pointers, and so can be a bit tricky especially for people who aren't used to working with them, but with some simple code patterns you can learn to add to them, traverse them, delete them, and so forth easily. (Well, kinda easily, lol.)
Other Videos By Bill Kerney
2022-02-22 | Week 7 - Voronoi 2: Lloyd's Algorithm + Edge Detection |
2022-02-16 | Lecture 42 - Lambda Functions, Pointer Loops, Function Pointers, Life |
2022-02-16 | The Housing Crisis |
2022-02-15 | Voronoi Regions |
2022-02-14 | Linked Lists III - Inserting and Deleting from the Middle |
2022-02-14 | Ethics (Part IV): Virtue Ethics |
2022-02-13 | Linked Lists Part II: More Push and Pop functions |
2022-02-11 | ACM Workshop: Intro to Python |
2022-02-11 | Ethics (Part III): Kantian Ethics, Natural Rights |
2022-02-10 | Importing a material into UE4 in 10 minutes |
2022-02-09 | Introduction to Linked Lists |
2022-02-09 | Facial Recognition and Ethics (Part II on Ethics) |
2022-02-08 | UE4 Niagara (+ a bit on Source Control) |
2022-02-07 | Advice on how to approach the RTX On project |
2022-02-07 | The Ethics of NFTs |
2022-02-04 | Bounding Volume Hierarchy |
2022-02-04 | Conditionals |
2022-02-02 | Iterators and Ranges in the C++ Standard Library |
2022-02-02 | Truth Tables |
2022-02-01 | The Rasterization Pipeline in an Hour |
2022-01-31 | The Standard Library |
Tags:
csci 41
linked lists
c++
data structures
segfault
nullptr