Explaining Data Structures Until I Go Insane

[@AshifKhan-sn6jx]

Based melancholy of haruhi suzumiya thumbnail

[@successorofpgg1709]

No, that’s from When Supernatural Battles Became Commonplace

[@AshifKhan-sn6jx]

​@@successorofpgg1709 the thumbnail was different when I saw it

[@natam1616]

it the thmbnail was from suzumiya it was better then

[@joccie7113]

its satou from welcome to the NHK for me

[@ceejaytwoyoshi8536]

i forgot that yt videos can have multiple thumbnails at random now so it's probably that

[@Seacle14]

Just saw this on my feed and just wanted to say I found it hilarious that it takes only 8 minutes for you to turn insane.

[@miguelborges7913]

Only? I wished I lasted that long...

[@cyberneticsquid]

I found it hilarious it takes 8 whole minutes for them to turn insane

[@alexeyamosov664]

6:42 DFS and BFS are not for trees only, they can be used on any graph, even one with cycles

[@Wanderer3639]

"use stack for parentesis problem"... aaaaa I remember using lists and a lot of loops and conditionals.

[@marijnkneppers2340]

this video should have stopped directly at the start. No one can stay sane while explaining data structures

[@chri-k]

a B+ tree is

[@TheFel0x]

Thank you for putting the music in the video description! I wish more people did that :D

[@MultsElMesco]

@@TheFel0x no worries! I'm glad you found them. Edit: my first comment sounded kinda passive aggressive and that wasn't my intention so I rewrote it

[@LionHeartSamy]

I love how throughout the video I kept thinking, "Wow the background music sounds so familiar but I can't tell where I've heard them from." Then you started talking about trees and I immediately remember being traumatized by UlforceVeedramon.

[@-goodwin]

3 days until my Data Structure midterm, what a great yt recommendation.

[@Heliox98YT]

I swear, I was looking at some of the Codility training lessons, because i have an interview soon, and some of those problems they have there are actually insane. I feel like they just kept changing the problems to have new ones, untill the only ones left to chose from were so niche, and hyper abstract that it's actually ridiculous. I am not even a beginner, i'm a senior already.

[@jagagemo8141]

The playlist for this video is next level.

[@hodayfa000h]

Ok i was waiting for such a video

[@xWatexx]

No, you don’t seem to understand. Data structures are something that you can learn how to make, but they actually work with black magic and it’s not worth questioning how they function.

[@knafehyafawi]

see it wasn't the understandability of the video but the persona 3 reload ost that hooked me. i will subscribe. thank you

[@nachtknot9822]

nah man a programming channel with subtle digimon references? im in

[@marchesilvet8096]

clicked this video thinking its about osu! i should really read titles

[@Supakills101]

Trees are actually a special case of a DAG (Directed Acyclic Graph) with the restriction that a child can only have one parent so you already know some graph theory!

[@MultsElMesco]

I hope you like data structures. Also join my discord server: discord.gg/jpJdqDdQcv (And follow me on twitter, I retweet stupid memes: twitter.com/ionelalexandr12 ) Off topic but a lot of people have asked me what my VSCode theme was. I made a community post about it a few weeks ago so you can check it out. To try everything Brilliant has to offer-free-for a full 30 days, visit brilliant.org/Mults You’ll also get 20% off an annual premium subscription.

[@arahn466]

nice intro dude

[@gav_m5]

Subscribed. I love your humor :D

[@average-neco-arc-enjoyer]

now I know how to use the sylladex

[@roastyou666]

Please do one with red black tree

[@khlorghaal]

i have literally never seen someone use one of these irl lmao

[@AlexDeathway]

0:23 Subscribed!

[@ahmoin]

0:54 my boy teej devries already explained why 1-based indexing (lua) is better than 0-based indexing

[@mage3690]

-1 need indexing (Dreamberd) is objectively the best. The -1 index holds type information and size, hence it's superiority. Not that Dreamberd does that, but still.

[@d4rkmn643]

Ive done enough (i think) graph problems to say that they also are just do bfs or dfs depending on the problem and maybe also use a set to keep track of something you need and that's everything. What makes me personally go insane about data structures is fucking btrees. I could never implement one, only managed to do insertion, and it still haunts my dreams to this very day, for i was not strong enough to accomplish such a daunting task. Dont even get me started on B+ trees

[@0xhhhhff]

Cool. I have a lot to learn

[@xerathgaming1915]

i love implementing a linked list in c

[@saultube44]

@7:39 Definitively Not totally torrent downloaded 😁👍

[@khlorghaal]

ive been programming for 20 years and have never in my life balanced or inverted a tree

[@RockyKumar-jk3bh]

Which ai you used to create your video

[@gdkid]

graphs are trees on steroids

[@Skult1]

Finally some good fucking content

[@MultsElMesco]

Gracias tio skult

[@marceloguzman646]

7:22 idk why i laughed

[@GiyuTomiokaTheOneAndOnly]

Fun fact FIFO is only for simple queue 🌝

[@DandeHakker]

I don't have free time, just bad time management 💀

[@vignesh306]

I have a suspicion this guy plays ULTRAKILL

[@Kizuroki]

NOOOO i needed graphs ;-;-;

[@minhhieule5079]

Ah C. It like being an adult. Gotta take out your own trash. Can do what ever you want but suffer the full sequences of your action.

[@marxy37dev]

* looking at outro * ...Do you need a sandwitch Multus? :3

[@TheEmolano]

C mentioned :)

[@itzerrio]

song from k-on, nice

[@muhammet8800]

Am I dreaming because of full of data structure exam prepare last night or there was a anime girl

[@Some_Dev_Guy]

do you want to hate trees even more? check out segment trees and lazy propagation

[@kira991]

Looking at thumbnail I thought this is a osu! video

[@lucasa.teixeira9692]

False title, u already started insane

[@alexeyamosov664]

“Explaining data structures until I go insane” Video could’ve lasted 2 seconds had you started with a persistent treap

[@pabloktar]

Christian would be proud🥹

[@nimeshpoudel89]

Also don't forget to free up the memory if you are using C. caught me off guard

[@ArchieHalliwell]

list processor

[@ServerGhost-d8p]

yo i am early this time rare

[@atharv-naik]

Who's the waifu in the thumbnail?

[@isaac_2605]

ª

[@TSA595]

Don't do this to me

[@scientificthesis]

Why does the data need to be structured????

[@AshifKhan-sn6jx]

Data structure is used to optimize a specific thing like data access, insertion, deletion or modification and algorithms need their data in a specific form (data structure) to work effectively.

[@youarethecssformyhtml]

Why don't you search in Google and KZbin?

[@mohammadkayed7780]

that's no way to support data, it's been in rehab for 6 months now, it never fully recovered from the accident, data needs your help to get it's act together and start being structured again

[@vamsidheeraj4364]

Thank you for stopping the video at graphs. I hate them more than sakura from naruto.

[@domi-no1826]

I read homestuck once and learnt absolutely nothing (This is the only thing i remember)

[@1Tbiribiri]

I clicked because God was on thumbnail

[@edinaldonokyojin8974]

If your consider this as God you are definitely lost in life

[@Heliox98YT]

Do algorithms make you cry? well I've got the perfect solution for you! Switch career paths, it's not too late.

[@hamzacasdasdasd]

fun fact video is just 8 min

[@Barry9-11]

Bro Libya 🇱🇾 is 100% Muslims the country with most Quran memorizes

[@drominitoketchup]

i saw how to make a triangle, and i wanted to try it out. I comed to this here: #include #include #include #include #include int main() { // equation -> y = -|x| + 10 const int y = 25, x = y; for (int i = y; i > 0; i--) { for (int j = -x; j < x; j++) { if (-abs(j) > i - x && i != 1) printf("."); else if (-abs(j) == i - x || (i == 1 && j < x-1 && j > (-x + 1)) ) printf("#"); else printf(" "); } printf(" "); } return 0; }