a) Tree
b) Heap
c) Priority queue
d) Stack
Answer: d
Explanation: The Tower of Hanoi involves moving of disks ‘stacked’ at one peg to another peg with respect to the size constraint. It is conveniently done using stacks and priority queues. Stack approach is widely used to solve Tower of Hanoi.
Related Posts
Which one of the following operations returns the first occurrence of bit 1 in bit arrays?
Bit fields and Bit arrays are same.
What does Hamming weight/population count mean in Bit arrays?
Run-Length encoding is used to compress data in bit arrays.
Which of the following bitwise operator will you use to invert all the bits in a bit array?
Which class in Java can be used to represent bit array?
Which of the following is/are not applications of bit arrays?
Join The Discussion