JavaScript Data Structures: Getting Started
ฝัง
- เผยแพร่เมื่อ 5 ส.ค. 2020
- When working with JavaScript, you'll work with data structures all the time. That includes built-in ones like Arrays, Objects, Maps or Sets but - especially if you dive deeper into JavaScript - also custom data structures like Linked Lists, Trees or Graphs. This course covers it all and in this video we will get started with the basics!
Join the full "JavaScript Data Structures - The Fundamentals" course: acad.link/js-ds-fundamentals
The course is also part of our Academind Pro membership (30+ courses for only $19 per month): pro.academind.com/
Join our Academind Community on Discord: / discord
Check out all our other courses: academind.com/learn/our-courses
----------
• Go to www.academind.com and subscribe to our newsletter to stay updated and to get exclusive content & discounts
• Follow @maxedapps and @academind_real on Twitter
• Follow @academind_real on Instagram: / academind_real
• Join our Facebook community on / academindchannel
See you in the videos!
----------
Academind is your source for online education in the areas of web development, frontend web development, backend web development, programming, coding and data science! No matter if you are looking for a tutorial, a course, a crash course, an introduction, an online tutorial or any related video, we try our best to offer you the content you are looking for. Our topics include Angular, React, Vue, Html, CSS, JavaScript, TypeScript, Redux, Nuxt.js, RxJs, Bootstrap, Laravel, Node.js, Progressive Web Apps (PWA), Ionic, React Native, Regular Expressions (RegEx), Stencil, Power BI, Amazon Web Services (AWS), Firebase or other topics, make sure to have a look at this channel or at academind.com to find the learning resource of your choice!
thank u, Max, in case others may wonder what's next, here's the list
Stacks (custom)
Queues (custom)
Hash Tables (custom)
Basic Trees (custom)
Binary Search Trees (BST, custom)
AVL Trees (custom)
Priority Queues (custom)
Heaps (custom)
Graphs (custom
0:00:00 Intro
0:06:16 Arrays
0:15:14 Sets
0:21:00 Arrays vs Sets
0:22:35 Objects
0:29:41 Maps
0:37:18 Objects vs Maps
0:39:02 WeakSet & WeakMap
0:41:18 A Custom Data Structure - Linked List
1:24:00 Why would you want a Linked List
1:26:46 Time Complexity & Big O Notation
1:28:42 Linked List Time Complexity and Arrays
Max your skills admires me to learn all the unknown new framework . You are simply amazing. I have done your Angular course with PWA and now Mongo!!!
My interest in js was slowly fading because of all the boring stuff I wad doing on a daily basis.
The way you teach is appreciable , you made me hungry to learn again! Thanks
Subbed ... Why didn't I find this channel earlier??
Thanks a lot
The way you walk through building the linked list code is so helpful, thanks!
I just bought your react native course on Udemy and I remembered DS with javascript and I said I need to find a course about that and I get yours here . What a coincidence, you're great .
Sorry to be so off topic but does anyone know of a way to get back into an instagram account??
I was stupid forgot my login password. I love any tips you can offer me.
Thanks max, for this course and its really going to help lot of js dev
Thank you Max, i'm really grateful. I've been trying to wrap my head around data structures since i was told about it, but it always seemed so difficult and confusing. But, after watching both your tutorials on Big O notation and data structures, it's all starting to make sense and i'm understanding it much better😁😁😁😁, i even added two extra functions to my LinkedList class (removeHead and removeTail) and it worked fine. Thank you for your support, i'll be sure to get the course on Udemy soon enough😊😊😊😊😊😊
Man, you explain things so well. Its amazing. Love the content
I love the way you approached it, please keep continuing, Thanks a lot
Max, thank you so much for sharing this great content.
It is really very useful and helpful.
Can't really believe it is free.
Thanks again.
Linked list Example is helpful and great. Just two suggestions Max
1. In the insertAt method, this.tail reference will not be changed if we insert element after the tail.
2. The delete will thrown error if there is only one element in the list and if we delete that element. Moving the check 'if(!this.head) return' check after the first loop will fix this.
Awesome explanation. I was afraid to learn about Data structure, but you made easy to understand. Thankyou Max
Awesome ! I just started data structure in javascript & u uploaded this video :)
you are my favorite tutor in youtube. your teaching are so good .
I started learning to program about a month ago and this class was very elucidating. Thank you so much for your giving us part of your knowledge for free!
gave you got a job yet?😅
@@nabeelkhan-ck8bq did u!?
Thank you Max. Love your dedication in these troubling times.
what datastructure will you choose when you need to store list of objects and you need to get item by id , items by ids and also filter by object properties? arrays or map witf for loop filter? or something custom?
Max, nice video. Thank you.
One suggestion: you may also create a Node class so that simply we can create a new Node object with value having next property set to null (like as new Node(value).
Thanks so so much maxx, i began my career because of you!!!!!!
I have just one word for you - GREAT.
clear, concise, to the point.. Thanks!
A good usecase for sets would be to store usernames in a database since they need to be unique for every user, good video so far 😊
Really really amazing tutorial, thank you so much MAX.
This is what I was looking for. Map function of rest Api from php cms
Thank you Max. This material is awesome. thank you for providing for free.
Thank you Max.
Can you show the performance gain we got by using LinkedList over traditional array?
Is there a way to calculate exact timing?
I found a loop in your video. After 1:27:00 you suggest going through algorithm course first, but in the algorithm course (near the beginning) you suggest doing this course first--- which is what I'm doing right now. ;-) But, I wasn't complaining, it's programmer humor. Thanks, the linked list example was nice.
You made so easy to understand, great video!
Please upload videos every week, we miss those days you kept on uploading videos continually
Great video as always! Thank you!
I think there will be an error if you will try to use find() method on list with only one element.
null.value
Thanks for explaining it perfectly. You just eas out the DS
max really thank you , i love your the way you explain any thing , happy to learn from you bro thanks 😀
The delete function in the LinkedList class has an error because after the first while, if all the values in the LinkedList are equal to the value parameter, the head will be equal to null, and the second while will throw an error because it tests head.next.
Hi Max, do you plan to do new courses related to Laravel (PHP Framework), real project or something like this. I have learned a lot from your related courses. You're one of the best instructors I've ever met on the Internet, especially 'Udemy', Pluralsight, and 'TH-cam Chanel'. I respect you very much! :)
Oh man you are awesome, I learned a lot form your tutorials. Thanks
One of the best teachers I've ever had
LinkedList structure could be beneficial for keeping track of history / states. Since you always add thinks to it, if you want to undo / redo, you want to have the first element.
Thanks for this lesson. Very good stuff as always
I'm super excited for this tutorial 👍
Thank you Max, could you please put the link of your algorithm course ?
Great sir.Best channel for web developers
Hey Max, the prepend didn't work if I do prepend first and append next. Like below,
var LL = new LinkedList();
LL.prepend('first');
LL.append('next');
LL.append('Last');
Happy teacher's day Maximilian, you're my real guru 😎
This is just awesome. Thanks a lot for this.
linkedList prepend method - shouldn't you need to check whether if there is any this.head before you insert it to the newNode.next??
Hi Max,
Can you please share a new video with the introduction of micro front ends?
Thanks.
i was really waiting for a such video from you.love and support
Regarding LinkedList example, can anyone explain to me how the head keeps on updating even though it was only assigned once?
My favorite teacher Mr.Max Thanks
Wow, Thank you Max.
the append() method is a little bit confusing to understand if you're not familiar with reference/primitive types. thank you Max for your precious effort
I find this great channel for lesson javascript 😂😂🔥🔥🙏
Excuse me for this dumb question, is this code mean that the head contain every list in nested object form?
Thank you max, you're the best
You absolute legend. Thank you for this! :)
This is smart😎
Javascript Arrays does have the Unshift() method right? Does this method have O(1) or O(n)? I think the underlying functionality of Unshift() method is as you described: shifting the elements 1 by 1 as is suggested by the name of the method as well. Interested in your comments though.
I was waiting for ds algo course using js by max
Great topic, nice explanations, thanks
Great Course! Please keep doing this :)
Link-list, as always explanation excluding very important coding along (eg. appending i.e.working at the tail, vague basic unit building block explenation etc.)
I've a question is your udemy and academind courses are same please reply
Great course, Thank you
Can someone help me out with this?
Aren't we storing entire hierarchy in the head here?
i.e head has {value: 1, next : {
value: 2, next : {
value: 3, next : { and so on}
}
}
}
If yes, isn't that a bad idea for tons of data?
Can linked lists be used as a simple or ‘lite’ form of blockchain if its encrypted and distributed?
Why don't use the terms records or data sets?
can you please make a complete tutorial not only about Data Structures and Algorithms but also design principles (perhaps on Academind and/or Udemy), thank you again Max
Thank you for your efforts sir ,I've bought your udemy flutter course it was very helpful, and plz also mention the timestamp in your videos
Amazing explanation !!!
this is great! thanks for sharing Max!
Glad you liked it!
what if we store duplicate object in an set?
Also, i'v tried this code with:
const linkedList1 = new LinkedList();
linkedList1.append("second");
linkedList1.append("third");
linkedList1.append("delNode");
linkedList1.prepend("delNode")
console.log(linkedList1.toArray());
linkedList1.delete("delNode");
console.log(linkedList1.toArray());
and in the first log "third" node losing its next attribute (it is equal to null),
can you explain why does that happend?
When it will be available on udemy?
Just what i was looking for.
I have bought lots of your courses on Udemy, no regrets :D
I believe that if insertAfter is done on the last node (thus, becoming the new tail), this.tail needs to be updated to point to the newly added node.
Thank you sir, love from Bangladesh
Hi, Max, your course is amazing, but why your course not on Udemy?
This is what I was missing after going through countless tutorials and docs, Still, I couldn't figure out why I can't solve questions on the coding platform and interview (makes me nervous )😅
Huh, the course i have been looking for
I can't find Your DSA course in Udemy? Can you please send me the link?
Wow. This is what I need.
This was awesome
it's just so weird seeing you outside udemy, anyway thanks for the course Max they really helpful!
worst case complexity for inserting at the end of the array will be O(n) when we have to shift the complete array in case the size of the array increases
thankyou so much man!
You are the best... 🎉
Awesome! Thanx!
Thank you for you job.
Thank you Sir
fantastic!
what is the perquisites of this course ??
great speech. thx
really helpful.
Thank you ♥️
Heyy!!!!! I watched your udemy course a year or 2 back
which editor I should use to write java script. Which one you are using in this session
He is using VSCode
Thanks Max
Hello sir.
I have confusion in a code in linked list where in apppend() function we written
This.tail.next =newnode;
This.tail=newnode
Then why second line did not override this.tail value.
Please assist
to answer your question, that means we are talking "append a newNode to an empty linkedList". (so, these two lines of code will be both executed)
before we do "this.tail.next = newNode;"
we will check if that tail exist(= not null = it's a created object(the object already sits in memory))
and then, we update it's "next" attribute to the reference of current "newNode"
after running the above code,
we do "this.tail = newNode;" and update "this.tail" to point to the reference of newNode.
Because the value of "this.head", "this.tail", "this.next"(even "value" in newNode, if our value is an object) are all objects.
and in javascript, Object, Function, Array, Set.... are all reference types.
so, when you declare a new variable and assign any reference types value to it,
you will only assign it's reference (you can think of a memory address point to actual value in memory).
Therefore, when we change these values: "this.head", "this.tail", "this.next".. these values,
we are only updating the reference, not the actual value.
only if, originally, "this.tail" is assigned with a primitive value(in javascript, primitive data types: string, number, bigint, boolean, undefined, and symbol.)
and then you reassign a new value to it, now, the override happened.
I'm not sure if my explanation is answering your question, but hope it helps.
@@orionlu716 that really clear up my doubts. Thanks alot sir
thank you sir