This program was our Data structure 1 final project.
This program works by implementing binary search tree (BST) algorithm.
This program allows you to:
1: Load existing English dictionary to the program.
2: Let the user enter a word which could be spelled incorrectly.
3: Searche for the entered word and checks if it is located in the dictionary.
4: suggest ,if not found, the closest words for the user.
(These words are suggested by getting the Successor, Predecessor, and the word located in the last node of the BST).