Ordered Data Structures
University of Illinois at Urbana-Champaign
Life of a programmer can be as boring as there are only 2 things: arrays and linked lists. No surprise how big techs are fascinated by them during their interview process, (which is actually a mystery, since being a guru of LeetCode still does not mean you can land a job). So, do not be pragmatic. You want to learn this course, is because you are a control freak and simply want to enjoy the beauty of programming. 🙂
This course introduces a few critical data structures that almost every programmer will use every day. Binary search trees are only small piece of cake, AVL trees are getting interesting. The course only introduces B-trees quickly, but that is actually the point for practical use. B-trees and their variants are the foundations for the storage systems such as databases or file systems, that read and write relatively large blocks of data, remotely. Lastly, the course shed some light on the heap. This is a beautify data structure because you will see how math make arrays and full binary search trees meet each other.
I am Kesler Zhu, thank you for visiting my website. Checkout more course reviews at https://KZHU.ai
All of your support will be used for maintenance of this site and more great content. I am humbled and grateful for your generosity. Thank you!
Don't forget to sign up newsletter, don't miss any chance to learn.
Or share what you've learned with friends!Tweet