Question

dont use a struct use the std::stack library

In this assignment, you will finish the implementation of an iterative solution to the Towers of Hanoi puzzle. Specifically, you will implement the puzzle initialization and the move operation utilizing the stacks provided. Do not rename existing functions, nor add any additional functions nor member variables!

REQUIREMENTS

The program will read in a text file with containing a single integer: the number of disks for the puzzle.

The program will output the steps required to solve the puzzle for the specified number of disks.

The program will utilize the Hanoi class.

The program will utilize the std::stack library to complete the move functionality.

The only changes will be to the Hanoi.cpp file and will only be within the constructor and the

MakeMove function.

#include "hanoi.h"

Hanoi::Hanoi(unsigned int n) : m_Disks(n)

{

   // TODO: set then initial state for the problem

}

void Hanoi::MakeMove(std::ostream& os, unsigned int peg1, unsigned int peg2)

{

   // TODO: move the disks between pegs appropriately

   // NOTE: Make sure to call PrintMove for each disk movement!

}

Answer 1

# include < stdio.h > # include < math.h > # include < stdio.h > # include < limits.h > struct stack { unsigned size int top: int cure: }: struct stack create stack (unsigned size) { struct stack stacks = (struct stack)malloc(size of (struct stack)): stack rightarrow size = size: stack rightarrow top = 1: stack rightarrow arr = (int)malloc(stack rightarrow size sizeof(int));ruturn stack: } int is full (struct stack stack) { int is empty b(struct stack stack) { return (stack rightarrow top = = = -1) } void push(struct stack, int item) { if(is full(stack)) return: stack rightarrow arr[+ + stack rightarrow top] = item: } int pop(struct stack stack) { I } f (is Empty(stack)) return INT-MIN: return stack rightarrow arr[stack rightarrow top --]: } Void Move Disk Between Two poles (struct stack str, struct stack dest, chart s, chart d) { int pole1TopDisk = Pop(sre): int pole2Tpdisk = Pop(dest): if(pole1.Top Disk) = = INT_MIN) { Push(sre, pole2TOpDisk): move Disk(d, s, pole2TopDisk): } else if (pole1 Top Disk): Move Disk(s, d, pole1 Top Desk);