Lists, Iterators, and Abstract Data Types

[@hailsatanhallelujah]

Just wanted to say that I'm grateful for the series and you deserve more recognition

[@AlgorithmswithAttitude]

+hailsatanhallelujah Thanks. Over time, it might get more views, but especially for the beginning material, there are a lot of other videos out there. After I have enough material for an entire course, perhaps some teachers will start using it to help flip their classrooms.

[@cj4138]

You da man, man. Thanks for vids

[@AlgorithmswithAttitude]

+cj4138 Spread the word. Tell everyone, high and low, that I am the man. Or maybe just tell any CS classmates about the videos.

[@josephrichardson7366]

You blinked... Great short video I like how not language specific.

[@Anonymous_Wolfie]

I like your Attitude

[@ragnus78]

Can b-trees stored in an array and use max heap algorithm on that array?

[@AlgorithmswithAttitude]

There are a couple of problems with that. First, max-heaps aren't sorted structures like B-Trees. Second, the reason that max-heaps can use the implicit array format is because given a max-heap with n nodes, you know exactly what its shape is. B-Trees don't have that property, and when the B-Tree changes its structure, it isn't just a few nodes swapping places within a large order, entire new subtrees can be created, changing the order of many values within the tree structure, if you look at them like in the same way that you look at a max-heap. I hesitate to say something "can't be done", but for sure, it is not some minor manipulation that you are talking about, and I don't see how to do it.

[@albertwesker2050]

Jokes on you lots of people are watching your videos