MCQOPTIONS
Saved Bookmarks
| 1. |
Which data structure is most suitable for implementing best first branch and bound strategy? |
| A. | stack |
| B. | queue |
| C. | priority queue |
| D. | linked list |
| Answer» D. linked list | |