Linked List Data Structure | JavaScript
Вставка
- Опубліковано 23 сер 2024
- In this video we're going to learn about linked lists using OOP JavaScript (ES6 Classes). Linked lists are very popular in interview settings and are good to know.
Code:
gist.github.co...
Sponsor: DevMountain Bootcamp
goo.gl/6q0dEa
💖 Become a Patron: Show support & get perks!
/ traversymedia
Follow Traversy Media:
/ traversymedia
/ traversymedia
/ traversymedia
I am a little rusty on algos, data structures, etc but would like to get into this type of stuff, let me know what you guys think about that.
Yes brad please make a crash course or even better a whole data structure series. thanks
Please Continue to do more.
It makes us industry ready
No, You are awesome
Im bad too when it comes to algorithms I keep forgetting about these things
@@alaindimabuyo Yeah, they aren't things I use in my daily projects, however they are great for building muscle in that part of the brain :)
Great video, thanks for taking the time to put this together this together @TraversyMedia!
One small thing. For you insertAt() and removeAt() functions, I'm pretty sure you want to flip the sign and use an || operator to account for less than 0 values. `if (index < 0 || index > this.size)`
Hey Brad , just want to thank you for all the efforts you take for us.. Would love to have a series on data structure Javascript. Love from India 💓
From East Europe too)
from india too
Hey Brad please upload Data structures in js crash course or big course ...please
Most awaited. Please do more videos on data structures.
I wasn't able to understand all of this after weeks in a computer science course, but 30 minutes into your video I have a much better understanding. You are great at explanations and don't over complicate topics. Thank you so much for this video!
I laughed in this coffee shop when you said, "But don't be a dick about it!" Haha!
Me too..that was great!!! :-)
and here I thought it was only me rofl.
Can you do queues, stacks, trees, graphs, recursion? if possible Just a whole series on Data structures and algorithms
This dude is a genius. Not just as a developer, but as a teacher. Thanks, Brad! Data structures is by far the most significant hurdle in programming, and I haven't been able to find anyone who can explain the concepts at a level I can understand. It's hard to teach concepts that are basically abstractions built upon abstractions. But from all the resources I've looked at, Brad has come closest, and in JavaScript no less. Bring on more data structures!
nah, his voice is quite boring, it sounds like he wants to just close the editor and throw his monitor out of a window. There is an example of a good teacher/programmer - "net ninja", I strongly recommend to look at his videos.
When I first watched this video almost three years ago I was completely lost and could never follow along. I took another shot yesterday and was able to understand it now. If anyone needs help, I will gladly set up a google meet call and explain it with a debugger trace if we need to. Just passing along what others have done for me in the past. Thank you Brad, this was a great explanation!
I love your content so much. You're the only teacher that really makes things click in my mind
the goat, feeling much more comfortable with LinkedLists after this video. Thank you.
thank you for always being straightforward and keeping it concise. Been watching your videos and following your tutorials for the past year and they have been an immense help. much love from California!
I'm a Full Stack student and just wanted to thank you for this video! It really helped me wrap my brain around the concept of Linked Lists👊🏾
that's a great example of creating and working with Linked Lists on JavaScript. Thank you
Brad i realy don`t understand why you don`t have at least a million subscribers. You're one of the best youtube IT-blogers (for me you`re the best).
Dude this should indeed be a series, best explanation ever on this topic
You make learning so much easy. Really appreciate you taking the time to make me understand this better than most tutorials out there!!!!
Excellent introduction to a new topic for me!
One edge-case we're missing here for the insertAt() method is a negative value being passed as the index. I found that this can be better handled by setting up the "index out of range" conditional to be: "index < 0 || index > this.size", so we simply return (do nothing with the data value) if the index is less than 0 or greater than the size of the linkedList. In my testing that gives us the functionality we want, without a resulting "Cannot set property 'next' of undefined" if a negative index value is passed.
the best video i have seen about linked lists, simple and straight to the point. Well done.
I think it's great that you've started getting into this topic. I've had a lot of trouble reading about this stuff and then implementing it. But seeing it from you, then thinking about it for a bit, then going back and trying it myself, has really done the trick.
Bro, do all the data structures PLEEEEEEEAAAAAASE. I've been looking for videos that discuss data structures and here you are. God sent. Please do more. Pleeease pleeease
Quite glad that you are getting your feet in core CS . It's a rabbit hole from here on and it's really fun as you start diving deeper.
15:49 "Just don't be a dick about it please." LOL! Thanks for being a real one Brad, and for always producing easy-to-follow videos.
This was very helpful! Today we are learning LInked Lists and React in bootcamp, and this is a great prep for class tonight! Thank you for creating this content!
Thanks Brad, you did an amazing job again. Finally you did data structures and algorithm 👏🏼💪🏻
"just don't be a dick about it please" caught me off guard. So funny. Thanks for the video, helps to hear different people talk about data structures.
Best tutorial about linked lists. Not just for JS. I searched for java too and this is the best I saw. Since there is just some difference in syntax every c# or java programmer should watch this too.
// Insert at index
insertAt(data, index) {
// If index is out of range
if (index > 0 && index > this.size) { ---------this line should be like this----------> if (index < 0 || index >this.size){)
return;
}
I checking for this comment :)
That'd mean it won't insert when index is greater than zero even if it's less than the list size. if (index > 0 && index > this.size) is correct.
Of course as i've been getting into linked lists, here Brad is with a brand new course on it, love it!
Thanks for the tutorial, I was doing an exercise from Odin Project and can't seem to wrap my head around this list. Your demonstration was very helpful, once I figured out the head variable was the key to this linked List structure, I picked this up real fast. Thanks!
First 10 mins was all i needed, my professor couldn't explain this in 3 hrs.
You taught so much about something so difficult, even to people like me who don't understand clear English. Amazing! Thanks for simple explanation dude
Initially i did this data structure on my own and then watched your implementation, and this really makes your brain find different solutions
"Don't be a dick about it" I love how honest you are man...
Can't wait for that. The normal projects have become quite popular here on UA-cam
Thx you saved my life... I had a project to do for tomorrow and I knew nothing about that ... I was doing Java but the options are the same so thank you very much
Thank you for doing this. Please do them for all of the Data Structures. This will be super useful for people try to start out
Thank you Brad. Aye for the series on data structures and algorithms. I watch your videos for dual purpose, to learn and to fall asleep.
r u implying that his vids are boring? :P
@@blasttrash Naah man :), videos are damn good and informative, but he has this amazing white noise like voice, so if you watch during the night, you will fall asleep in no time. Try it :P
Thanks a lot for taking the time to explain this. I've been having a difficult time understanding the logic behind linked lists, but now I feel like I am getting it :)
Great tutorials , sir
You made me a real Developer.
Hi Brad, I've been watching your video for years. A little surprised seeing you started algos and data structures. Thanks for sharing. Love you, your Chinese fan.
you just blow it!!!! How you even do it ....I must say you are X-MEN Mutant YOU JUST MADE LINKDLIST SUPER EASY WITH MOST CONFUSING MODERN JS WOW
This tutorial made linked links easy for me
Finally some data structures
Thanks
Hey, Brad, nice explanation. Thanks a lot for this excellent video. I would like just to make a small correction. It seems your range validation is not totally right. You wrote: if (index > 0 && index > this.size), but it will fail passing negative indexes. I believe the correct would be if (index < 0 || index > this.size). What do you think?
More algos + data structures please! Also some techniques + tips and tricks on how to solve problems. Your tutorials are very informative and easy to understand.
Line 93 change(index > 0 && index > this.size) to if (index < 0 || index > this.size)
thank you, your tutorials are helping us a lot a appreciated. 🙏
this brings me back (comp sci degree, but never got a job at it)...good stuff! I think maybe for inserting at index the bound check could be index < 0 || index>size? although using a negative index to insert from the end would be a fun exercise too.
Hey Brad , just want to thank you for all the efforts you take for us.And please upload the important topics of javascript in the point of interview please.
This is my getAt method, if you find it more clear:
getAtIndex(index){
if(index>0 && index>this.size) return
let count = 0
let currentNode = this.head
while(count
Yes! More data structures please
Amazing man. Thanks for everything. Trully amazing. i grasped everything after carefully watching the video
Hey Brad thank you so much man. It's important you know your work is helping people out here. I am more confident in my Javascript cause of your course.
This video was super helpful and informative. thank you Brad!
I think that you flipped your comparator on line 46. I think you meant to look like ` if (index > 0 || index > this.size) {` which would account for possible negative indexes provided, whereas checking for positive indexes seems like the case that you are looking to execute on.
haha i'd been doing this in school algorithm and data structure, we used to implement double linked list. great to see that you jump into it. this course is really cool and understandable. great work . Love From Cameroon
C'est la base d'algorithme de liste chaînée. Très bien expliquée
Sweet. This takes me back to my university days. Love it!
Hi brad Sir, without watch this video because I know you always bring great stuff that is easy to learn. I am greatfull you.
Nice LL overview that is easy to follow and understand. Thanks!
Nicely explained! More of these computer science flavored videos are very much welcomed :-D
Yes! More of these please. Maybe some video about pointers and stuff like that.
Thanks Brad! This is a good video. Looking forward to learn data structures and algos from you :)
Thanks brad for your efforts. would love to have a series on data structures and algorithms.
Yes, Keep them comin Brad! Damn you are creeping towards 1mil subs! Good job!
Programming itself is an algorithm and this is useful. Thank you !
Thank you Brad. You are turning me into an awesome developer.
Please, more videos about algorithms and data structures
Love the video, nice work as always!
Hey Brad , really love your work . Thanks a lot. A big inspiration for me.
Thank you! Your video is even better than a book i bought
THis is pure knowledge :) Thanks Brad
@ 7:10 I saw you almost naming your method insertHead.
Was waiting list data structure from you and finally. Thank you Brad.
As always, your tutorial is the best. Thank you!
very nice to start on Data structures and algorithm
there a tons of this but not much more easier than you brad
I really enjoying to see your tutorials
Thanks for this new lesson! I loved it. I would thank much more for other lessons about those programming core subjects applied to JavaScript.
Hey Brad. Great video. I notice a small problem(?).
You use "if (index > 0 && index > this.size)" but if we pass a negative index, the application will throw an error. Instead of "if (index > 0 && index > this.size)", we could use "if(index < 0 || index > this.size)". What do You think?
Really helpful! Thanks again Brad!
Yaaaaaaasssssssss!!! BRAD PLEEEEAAAAASSSSSEEEEEEEE! KEEP DOING MORE TUTORIALS LIKE THIS!
Do more algos and data structures! Thanks for the awesome videos!
Thanks a lot Brad , we are awaiting your expert videos on exhaustive list of data structures like Stacks,Queues,Circular-Queues,Circular Linked list, More operations on linked list, Doubly linked list and all its operations , Tree,Binary tree, HashTable,HashMap,Binary search tree last but not least AVL trees . This would immensly help the Javascript community over there . With bestest regards-Sumanth
Amazing explanation, thank you so much!
Thank you very much Brad.I learn many things from you and i like the way you teaching us.please make a full course on data structure , algorithm and graph...Love from Bangladesh
Love from India Brad ❤️
More I love the way you explain!!
Thank you for all the wonderful content
You explain things very well. I always come back here to learn new sorcery :P
best tutorial about linked list!
Please make a complete series of data structures and algorithms in javascript.
I love the way you play with. You are talented in how to deliver information Thnx 😘 bro
Really good man, looking forward to more such content. ThankYou
Thank u for this awesome video, please make whole series on data structure
Your effort and tutorial help us alot. Love to learn data structures in JavaScript from you
For ppl who might be confused in the first place how we remove the node from list:
if there is nothing that points to a specific node
the node and all of the nodes next to it are all gone due to memory cleaning.
thanks for awesome tutorial. but you have to use "break" within getAt() -> in if(count==index) condition. otherwise it traverse till the end.
We doing data structures now? Hurrayyy
please either make a series of all the important data structures or tell us where to find them on the internet(with code in js)...thank you for everything :)