Sure thing, let me pull up the code and walk through each branch. Just point me at the part where the node is swapped up, and we’ll check that the parent pointers and heap‑property checks are sound in every edge case, like when the node is a root, a leaf, or in the middle of a dense subtree. I'll also make sure the lazy‑decrease‑key path doesn’t break the min‑heap invariant after a bulk update. Sound good?