heaps removed ab last node swap cd swap swap figure removing the maximum node at each position of the target node the trickle-down algorithm checks which child is larger it then swaps the target node with the larger child if it tried to swap with the smaller childthat child would become the parent of larger childwhich violates the heap condition correct and incorrect swaps are shown in figure figure which child to swap swapping the smaller child swapping the larger child wrong correct