{
  "translations" :{
    "en": {
      "av_c1": "Let's look at an efficient way to build the heap. We are going to make a max-heap from a set of input values.",
      "av_c2": "Working from bottom to top, from right to left, do a siftdown on each internal node.",
      "av_c3": "Process the node with value 3.",
      "av_c4": "Since it has smaller value than its children, swap it with its larger child.",
      "av_c7": "2 is done. Now let's do the node with value 1.",
      "av_c10": "Now we have a max heap."
    }
  }
}