InterviewSolution
Saved Bookmarks
| 1. |
Which of the following data structures can be used to efficiently implement a priority queue ?1). Circular Linked List2). Heap Tree3). Array4). Single Linked List |
| Answer» | |