In the worst case, the new root has to be swapped with its child on each level until it reaches the bottom level of the heap, meaning that the delete operation has a time complexity relative to the height of the tree, or O(log n).
U najgorem slučaju, novi koren mora biti zamenjen svojim detetom na svakom nivou sve dok ne spadne na donji nivo hipa, što znači da operacija brisanja ima vremensku složenost koja je povezana sa visinom stabla, ili O(log n).