Data Structures using C++: Lesson 3 - Linked Lists

If you have any questions follow me on Instagram, DM me, and ill get back to you.

Data Structures using C++: Lesson 3 - Linked Lists
If you would like to see specific videos, please feel free to ask.

If you found this video useful, please like and subscribe!

[horsebeast]

I know this video is really old, but i really had to say that I actually find this video amazing. I'm a beginner programmer and the way u explained everything so well makes it seem like a piece of cake !

[DZAKY]

god created you to explain linked list to us newbies ! please put that in your head JesseDietrichson !!!

[ellievo]

OMG! I wish you are my current data structure professor! The video really helps me out! Thank you very very very much

[nguaial]

Jesse,
You explained much better than a professor of a university which I went long time ago.
I was very frustrated with the understanding of O notation.
Thanks a lot for this video.

[alvaro]

My professor has a master degree in computer engineering, didnt understand her while explaining this in JAVA nor now in C++, but I got it int this video, thank you man, thank you!

[irenaremezova]

Thank you, Jesse!!! You are the best! Very thorough and clear explanation. It helped me a lot!

[MasonJuarez]

17 minutes into this video I've learned more about linked lists than in my past week and a half of lecture...

[dinotumu]

please put more lectures on data structures using c++

[johnnyquest]

I was hoping there may be videos on a few different topics that i am struggling to learn like these: 
Chapter 4 - Trees
4.1 Preliminaries
4.2 Binary Trees
4.3 The Search Tree ADT—Binary Search Trees
4.4 AVL Trees
4.5 Splay Trees
4.6 Tree Traversals (Revisited)
4.7 B-Trees
4.8 Sets and Maps in the Standard Library
Chapter 5 - Hashing
5.1 General Idea
5.2 Hash Function
5.3 Separate Chaining
5.4 Hash Tables Without Linked Lists
5.5 Rehashing
5.6 Hash Tables in the Standard Library
5.7 Extendible Hashing
Chapter 6 - Priority Queues (Heaps)
6.1 Model
6.2 Simple Implementations
6.3 Binary Heap
6.4 Applications of Priority Queues
6.5 d-Heaps
6.6 Leftist Heaps
6.7 Skew Heaps
6.8 Binomial Queues
6.9 Priority Queues in the Standard Library
Chapter 7 - Sorting
7.1 Preliminaries
7.2 Insertion Sort
7.3 A Lower Bound for Simple Sorting Algorithms
7.4 Shellsort
7.5 Heapsort
7.6 Mergesort
7.7 Quicksort
7.8 Indirect Sorting
7.9 A General Lower Bound for Sorting
7.10 Bucket Sort
7.11 External Sorting
Chapter 8 - The Disjoint Set Class
8.1 Equivalence Relations
8.2 The Dynamic Equivalence Problem
8.3 Basic Data Structure
8.4 Smart Union Algorithms
8.5 Path Compression
8.6 Worst Case for Union-by-Rank and Path Compression
8.7 An Application
Chapter 9 - Graph Algorithms
9.1 Definitions
9.2 Topological Sort
9.3 Shortest-Path Algorithms
9.4 Network Flow Problems
9.5 Minimum Spanning Tree
9.6 Applications of Depth-First Search
9.7 Introduction to NP-Completeness
Chapter 10 - Algorithm Design Techniques
10.1 Greedy Algorithms
10.2 Divide and Conquer
10.3 Dynamic Programming
10.4 Randomized Algorithms
10.5 Backtracking Algorithms
Chapter 11 - Amortized Analysis
11.1 An Unrelated Puzzle
11.2 Binomial Queues
11.3 Skew Heaps
11.4 Fibonacci Heaps
11.5 Splay Trees

[hamzabouzidi]

you're a genius, good teaching techniques

[paradox]

A really great explanation--thank you so much!

[ShenWolfe]

Definitely very helpful. Linked lists were very confusing to me.

[pokefurnoX]

Awesome explanation, thank you!, also will the insert, delete, and other functions look different if you have multiple variables with different datatypes?

[thedarkkhan]

Hey @Jesse Dietrichson
Good tutorial! I have a quick question:
In the MakeEmpty function, the 'temp' pointer was not created using the 'new' keyword, then how come you used the delete keyword to delete the 'temp' pointer? ( 28:32 )

[mazherarman]

plz make more video on data structure, tree and graph

[OVERORLY]

Dude  thank you for giving such a great explanation

[yanno]

thank you so much for helping with the delete fonction (Y)

[stanleykubrickk]

People who don't understand, basically first node you created will be the last node at at the end. Nodes are created to the beginning of the list and each node created shows previously created nodes address. So you start creating something reversely basically

[JnDaFraK]

Hey thanks for the video. I understand how linked lists work now. I just have one question: in the InsertItem() function, shouldn't you delete temp after start = temp?

[manishadas]

sir where is the full video series on DS using i want full teaching on this...but i cant find any such playlist on your site