Results (
Indonesian) 1:
[Copy]Copied!
dominance holds for the key in this node. If it does not, the algorithm exchangesthe node’s key K with the larger key of its children and checks whether theparental dominance holds for K in its new position. This process continues untilthe parental dominance for K is satisfied. (Eventually, it has to because it holdsautomatically for any key in a leaf.) After completing the “heapification” of thesubtree rooted at the current parental node, the algorithm proceeds to do the samefor the node’s immediate predecessor. The algorithm stops after this is done forthe root of the tree.
Being translated, please wait..