Heaps (or priority queues) are tree-based data structure that makes it fast to track order of retrieving priority items ๐
I have reviewed how heaps work in depth in the following blog post โฌ๏ธ
https://www.romaglushko.com/blog/heapify/
The article contains a lot of visualizations and could be a good way to understand how heaps work, especially for beginners. Also, heap is a popular topic on coding interviews.
Hope it'll be helpful ๐
Top comments (0)