[C++] Read a structure (Maza) from file and find pathways

IMPORTANT NOTE : All payments will be made once I receive all code and validate it. You are to prepare a C++ program in Linux environment that accepts one command line argument. This argument will be the name of a file containing a maze. The maze file is a text file made up of spaces for pathways, #’s for walls plus one ‘s’ and one ‘f’, representing the start and finish of the maze. You program should 1] Load the maze. 2] Print the maze with its solution marked in dots. Your maze MUST have the following structure Maze object: As a minimum, this will have a binary tree of row objects. Make sure the tree is balanced. It may contain any other data you need to make the program function properly. Row object: As a minimum, this will have an int y value telling which row it is. The binary tree in the maze object will use this value as the key value to store the row object. The row object will also contain a binary tree of maze point objects. Maze point object: As a minimum, this will contain an int x value saying where in the row the point fits. The binary tree in the row object will use this value as the key value to store the maze point. The maze point will also contain a char variable storing the type of maze point. That is, a ‘ ’, ‘#’, ‘s’ or ‘f’. Since the maze can be any size you MUST use binary trees to store it. At no stage may you use arrays or linked lists within your program to store the maze. As there is no binary tree in the STL you must use the template binary tree supplied with this assignment. A copy of the bintree.h and binnode.h files can be found in attachment. PELASE NOTE : You may not modify any of the code in bintree.h or binnode.h Your program must compile without fatal errors or warnings – using the g++ compiler. Your program will be compiled with the following commands and options g++ -pedantic-errors -Wall -Werror -ansi