Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Is 6.5.8 wrong? #497

Open
vivek-rd opened this issue Feb 26, 2024 · 1 comment
Open

Is 6.5.8 wrong? #497

vivek-rd opened this issue Feb 26, 2024 · 1 comment

Comments

@vivek-rd
Copy link

If 'i' is a leaf node and when A[i] > A[A.heap_size], the max_heapify function does not work in that case as the leaf node does not have any left or right sub-trees.

@Antitimofey
Copy link

Antitimofey commented Jul 14, 2024

This implementation should works:

HEAP-DELETE(A, i)
HEAP-INCREASE-KEY(A, i, +infinity)
HEAP-EXTRACT-MAX(A)
A.heap-size = A.heap-size - 1

Both HEAP-INCREASE-KEY and HEAP-EXTRACT-MAX cost O(lg(n)) time, so HEAP-DELETE also runs in O(lg(n)) time

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants