heapify down

Attractive Alpaca answered on July 12, 2020 Popularity 9/10 Helpfulness 2/10

answer heapify down

related Heapify

heapify down

Comment

Heapify down is used when we remove the top element from a heap. Removal of an element is done by swapping the top element with the last element at the bottom of the tree, removing the last element, and then heapfying the new top element down to maintain the heap property. Because this moves down the heap tree, it must perform two comparisons per iteration, with the left child and the right child elements, then swap with the smaller one. Because of this, heapify down is usually more complex to implement than heapify up.

Popularity 9/10 Helpfulness 2/10 Language whatever

Source: discuss.codecademy.com

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Jul 12 2020

Attractive Alpaca

0 Answers Avg Quality 2/10

Closely Related Answers

Heapify

Comment

Heapify(array, size, i)
  set i as largest
  leftChild = 2i + 1
  rightChild = 2i + 2
  
  if leftChild > array[largest]
    set leftChildIndex as largest
  if rightChild > array[largest]
    set rightChildIndex as largest

  swap array[i] and array[largest]

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: www.programiz.com

Tags: whatever whateve

Link to this answer
Share Copy Link

Contributed on Dec 26 2022

Hilarious Heron

0 Answers Avg Quality 2/10

heapify down

Contents

More Related Answers

heapify down

Closely Related Answers

Heapify

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.