Assignment Set 6 (Uploaded on September 24, 2013)
Deadline date:  October 3, 2013 before lab starts

Assignment 1: 
Write a C++ program to implement the stack ADT. You should use a 
class STACK with attribute int top and 
methods: void push (int element), int pop(), int Isfull(), int IsEmpty(). 

Assignment 2: 
Write a program in C++ that uses the above stack implementation to solve 
the maze problem. A maze is a 2D array (of size NxM) in which 0s represent 
open paths and 1s represent the barriers. The entrance is at the top left (0,0) 
and the exit is at bottom right (N-1 x M-1). A movement to any of the (at most) 
8 neighbours (N,E,W,S,NE,SE,SW,NW) are possible. We explore the maze by saving 
the current position and exploring unexplored locations. We do not visit an 
already visited location. 

 
Assignment 3: 
Implement the inorder traversal algorithm using C++. You should use a structure 
Node with members: int key, Node *left, and Node *right; and a class Tree with 
the required attributes and methods to implement the said traversal. 

------------------------------------------------------------------------
At the top of each of your program files, add the following. If you are writing 
multi-file programs, then each file should have it. 

/*------------------------------------------------------------------
Name: 
Roll Number:
Date of Submission:
Deadline date:  
Program description:
Acknowledgements: 
--------------------------------------------------------------------*/