This is to write a program to solve word searching puzzles. The program is to find words in a dictionary that can be spelled out in the puzzle by starting at any character, then moving up, down, left, rigt, or on any of four diagonals. This program is to read in a file, which has a single number which represents the size of the square word search puzzle, and then contains the puzzle each letter separated by a space. Underneath the puzzle will contain the list of words in the dictionary. I have requested something like this before, but the difference with this one is it is to use a binary search tree. The dictionary is to be implemented using a binary tree structure. You should use a pointer-based implementation because the tree is very likely not a complete binary tree!
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Source code must contain 3 files...header file, implementation of the header file, and a driver file which runs the program.
3) Also must include full documentation!
Needs to compile in C++ and linux g++!