Advanced Data Structures - Lectures 11 - 21

Hello Everybody!
I hope you are having a wonderful day.  This is the sequel to my previous post.
Advanced Data Structures is a lecture series on data structures and algorithms.  As I mentioned previously, the content in this series is roughly the equivalent of a 2nd-year data structures and algorithms course at a top Canadian university.  This is a 33 part series.  For the full playlist, check out (a video with the playlist is embedded above): 
This next batch of lectures cover the remainder of hashing then the concepts of a tree, tree algorithms, priority queues, heaps, an introduction to amortized analysis, search tables, binary search trees, and the starts of discussing AVL trees (a kind of self-balancing binary search tree).
There are more lectures on the YouTube channel, do check those out.  You can subscribe to the channel here, if you have not yet:

You can get access to the written note companion book at: or by supporting me at the General Support tier to get a personally signed digital PDF copy.

Have a beautiful day!