Scribd Logo
Upload

Welcome to Scribd!

  • Tower of Hanoi (Application of Stack) : Data Structure and Algorithms

    Uploaded by

    rajni
    10 views8 pages
    The document discusses the Tower of Hanoi problem as an application of stacks in data structures and algorithms. It presents the classic puzzle of moving a tower of disks from one rod to another according to the rules of only moving one disk at a time and never placing a larger disk on top of a smaller one. The complexity of solving the Tower of Hanoi problem is exponential, with the minimum number of moves required growing exponentially based on the number of disks.

    Original Description:

    Original Title

    tower of hanoi

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the Tower of Hanoi problem as an application of stacks in data structures and algorithms. It presents the classic puzzle of moving a tower of disks from one rod to another according to the rules of only moving one disk at a time and never placing a larger disk on top of a smaller one. The complexity of solving the Tower of Hanoi problem is exponential, with the minimum number of moves required growing exponentially based on the number of disks.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views8 pages

    Tower of Hanoi (Application of Stack) : Data Structure and Algorithms

    Uploaded by

    rajni
    The document discusses the Tower of Hanoi problem as an application of stacks in data structures and algorithms. It presents the classic puzzle of moving a tower of disks from one rod to another according to the rules of only moving one disk at a time and never placing a larger disk on top of a smaller one. The complexity of solving the Tower of Hanoi problem is exponential, with the minimum number of moves required growing exponentially based on the number of disks.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 8

    Data Structure and

    Algorithms

    Tower of Hanoi
    (Application of Stack)

    1
    Tower of Hanoi

    2
    Tower of Hanoi

    3
    Tower of Hanoi

    4
    Tower of Hanoi

    5
    Tower of Hanoi

    6
    Tower of Hanoi

    7
    Tower of Hanoi

    Complexity: O(2N)

    You might also like