The operation decrease-key(H,x,k) is an operation that decreases the key of node x by k (if k<key(x) ) in a binary heap. What is the maximum effort required for this operation?
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- After insertion of n keys, worst case running time of the algorithm would be _______________ An iterative a...
- Let the binary heap has depth equal to d. What is the minimum number of nodes in the heap?
- Let the binary heap has depth equal to d. What is the minimum number of nodes in the heap?
- What should come in place of ? in the above algorithm? An algorithm to delete the node/key k from a tree T ...
- What is the running time of the algorithm? An iterative algorithm to search for key k in a tree T is given ...
- Consider a B+ -tree in which the maximum number of keys in a node is 5. What is the minimum number of keys ...
- In Prim's algorithm, it will be reduced to _________ if heap is used to keep.
- What would come in place of two in the above algorithm? Here is an algorithm to insert a key k in a binary ...