Implementing a Binary Heap

Implementing a binary heap to query large datasets


  • Learn how to build a binary heap structure.
  • Learn what kind of problems can be solved using a binary heap.
  • Runtime of binary heap algorithms.

Mission Outline

1. Introduction to Binary Heaps
2. Heap Inserts
3. Speed Up Insert
4. Get the Max Integer
5. Pop the Root Value
6. Grab the Top N Elements
7. Using Python's Heap
8. Analyzing the Heap
9. Next Steps
10. Takeaways

Course Info:

Recursion and Trees


The average completion time for this course is 10-hours.

This course requires a premium subscription. This course includes six paid missions and one guided project.  It is the 6th course in the Data Engineer path.


Take a Look Inside

Share On Facebook
Share On Twitter
Share On Linkedin
Share On Reddit