code: function removeTreeRoot(heap, root, prev) {
    // Remove root from the heap
    if (root === heap.head) {
      heap.head = root.sibling;
    } else {
      prev.sibling = root.sibling;
    }
  
    // Reverse the order of root's children and make a new heap
    var newHead;
    var child = root.child;
    while (child) {
      var next = child.sibling;
      child.sibling = newHead;
      child.parent = undefined;
      newHead = child;
      child = next;
    }
    var newHeap = new BinomialHeap();
    newHeap.head = newHead;
  
    heap.union(newHeap);
  }
docs: Link two binomial trees of the same order.
  
  @private
  @param {Node} minNodeTree The head of the first tree to link.
  @param {Node} other The head of the second tree to link.