MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structure
→
Number Jumps Reach End Array Operation
→
The optimal data structure used to solve Tower of...
1.
The optimal data structure used to solve Tower of Hanoi is _________
A.
Tree
B.
Heap
C.
Priority queue
D.
Stack
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is the number of moves required to solve Tower of Hanoi problem for k disks?
The optimal data structure used to solve Tower of Hanoi is _________
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies