Premium Content

Heaps and Priority Queues

Complete binary trees for priority-based operations

This chapter requires a subscription to access.

What you'll unlock:

  • 1. Heap Property
  • 2. Array Representation
  • 3. Heapify-Up and Heapify-Down
  • 4. Build-Heap in O(n)
  • 5. Heap Sort
  • 6. Priority Queue Operations
  • 7. D-ary Heaps
  • 8. Real-World Applications
Subscribe to Unlock

Already have an account? Sign in