2-4 tree. L becomes empty. Update pointers for all the nodes v whose children are new/modified, and repeat the process with the next parent until the parent is equal to the root. Walk from the root to node , and update the values. Set k equal to n.

: If the bit of the element x is set to zero, x is a leaf of T. Delete x using the 2-4 tree delete operation. Starting from node x, walk in T to node , updating and pointers. Decrement n and k by 1.

DeleteMin(Q): Delete and return the smallest element from queap

1.Previous
3.Next