Which is the best Data Structure for Priority Queue implementation and why ?
name some other Data Structures other than the best one to implement a Priority Queue and Tell its advantages and Disadvantages .Thanks. Thanks Thanks Thanks Thanks Thanks in advance so much thnx
Usually a heap is used because of the quick inserts O(log N)
http://en.m.wikipedia.org/wiki/Heap_(data_structure)
For a discussion of the various structures used, and their advantages and disadvantages, see the discussion available here: http://en.m.wikipedia.org/wiki/Priority_queue
Collected from the Internet
Please contact [email protected] to delete if infringement.
Comments