I remembered that heap can be used to search whether an element is in it or not with O(logN) time complexity. But suddenly I can’t get the details. I can only find getmin delete add and so on.
Can anybody give a hint?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I remembered that heap can be used to search whether an element is in it or not with O(logN) time complexity. But suddenly I can’t get the details. I can only find getmin delete add and so on.
Can anybody give a hint?
You need to search through every element in the heap in order to determine if an element is inside.
One optimization is possible, though (we assume a max heap here). If you have reached a node with a lower value than the element you are searching for, you don’t need to search further from that node. However, even with this optimization, search is still O(N) (need to check N/2 nodes in average).