- Forum
- General C++ Programming
- Priority queue using linked list and hea
Priority queue using linked list and heap
Hi!
I have to implement the following problem using as ADT a priority queue and two DS: linked list and heap.
,,Consider n balloons that are moving vertically. Select the biggest number of balloons such that they will not touch between them. (Solution should also present the list of balloons.)"
Could somebody give me hint how to do it ?
I have to implement the following problem using as ADT a priority queue and two DS: linked list and heap.
,,Consider n balloons that are moving vertically. Select the biggest number of balloons such that they will not touch between them. (Solution should also present the list of balloons.)"
Could somebody give me hint how to do it ?
Topic archived. No new replies allowed.