Hi,<br><br>In CLRS, there are algorithms about DECREASE-KEY and DELETE-NODE.<br>However, in the Functional approach, I didn't find corresponding solution.<br>One approach may just mark the node as `deleted' and when pops the top element from the heap, we repeat it until find a unmarked node.<br><br>--<br>LIU<br><a href="https://sites.google.com/site/algoxy/home">https://sites.google.com/site/algoxy/home</a><br>