

MCQOPTIONS
Saved Bookmarks
1. |
Best-First search can be implemented using the following data structure. |
A. | Queue |
B. | Stack |
C. | Priority Queue |
D. | Circular Queue |
Answer» D. Circular Queue | |