Possible Recursive solution for [Insert an Element into a Max Heap]

Contributors
1

Continuing the discussion from freeCodeCamp Challenge Guide: Insert an Element into a Max Heap:

Solution 
var MaxHeap = function() {
  this.heap = [null];
  this.insert = (data)=>{
      this.heap.push(data);
      let heap = this.heap;
      (function maxHeap(index){
        if(data > heap[Math.floor(index/2)] & index > 1){
          [heap[index], heap[Math.floor(index/2)]] = [heap[Math.floor(index/2)], data];
          maxHeap(Math.floor(index/2));
        }
      })(this.heap.length-1);
  };
  this.print = ()=>{
    return this.heap;
  }
};
1 Like
2

there should be one more &. It should look like:
if(data > heap[Math.floor(index/2)] & &index > 1){