|  | The optimal data structure used to solve Tower of Hanoi is _________ Choose the correct option from below list
 (1)Tree
 (2)Heap
 (3)Priority queue
 (4)Stack
 
 Answer:-(4)Stack
 Note:-The Tower of Hanoi involves moving of disks ‘stacked’ at one peg to another peg with respect to the size constraint.
 |  |  |