8. Binary Heaps

MIT Introduction to Algorithms, Spring 2020 Instructor: Erik Demaine View the complete course: YouTube Playlist: Prof. Demaine discusses priority queue interfaces and sorting algorithms. Algorithms include, AVL sort for set AVL trees, selection sort for arrays, insertion sort for sorted arrays, and heap sort for binary heaps. License: Creative Commons BY-NC-SA More information at More courses at Support OCW at We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at