{
  "translations" :{
    "en": {
      "av_c1": "Here is the process for removing the maximum value from the max heap. We know that this value is at the root (array position 0), but we also need to update the heap when we remove it.",
      "av_c2": "We know that we want to reduce the array/heap size by one. So we swap the first and last positions.",
      "av_c3": "Decrement the heap by one, removing that last element.",
      "av_c4": "But now, we no longer have a max heap. Push the top element down as appropriate.",
      "av_c5": "Swap the root with its left child.",
      "av_c6": "Swap with its right child.",
      "av_c7": "Done."
    }
  }
}