01-19-2012, 02:40 PM
Is heap an implicit data structure for Priority queue?
No, A priority queue is an abstract data structure, independent of how the data is organized. A priority queue can be implemented as an unordered list, a sorted list, a linked list, etc. Some better than others in their support of the priority queue operations, depending on the characteristics of the data to be managed. A heap happens to be a good data structure for an efficient implementation of a priority
No, A priority queue is an abstract data structure, independent of how the data is organized. A priority queue can be implemented as an unordered list, a sorted list, a linked list, etc. Some better than others in their support of the priority queue operations, depending on the characteristics of the data to be managed. A heap happens to be a good data structure for an efficient implementation of a priority
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]