Heaps (W7D5) - Learning Objectives

Heaps

• Explain and implement a Heap.
  1. What is a max (or min) heap?
  2. How is a binary heap different from a binary search tree?
  3. What is a complete tree? How does it relate to heaps?
  4. What is a commmon way to represent heaps in JavaScript?
  5. In this representation, how can we find any particular node’s parent or children?
  6. What processes do we need to follow when we insert an element into a heap?
  7. What processes do we need to follow when we remove then root of a heap?
  8. Given an array, determine if it represents a max (or min) heap.