I need a min-heap implemented as a binary tree. Really fast access to the minimum node and insertion sort.
Is there a good implementation in stl or boost that anyone can point me too?
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 need a min-heap implemented as a binary tree. Really fast access to the minimum node and insertion sort.
Is there a good implementation in stl or boost that anyone can point me too?
I think std::priority_queue is what you are looking for.