Spell-Checker



　　This program is implements by using AVL Tree algorithms. Its mainly implement by five functions which include AVL_insert, AVL_remove, AVL_destroy, AVL_findNearest, and AVL_print.



　　The algorithm for the function of AVL_insert and AVL_remove, actually similar to the ALV Tree insert and delete algorithm that we have learn from our lecture notes.

　　The function of AVL_destroy actually destroys all the nodes by scanning the whole ALV tree once.

　　The algorithm for function of AVL_findNearest is scanning the element by using the BST algorithm and moves the pointer s1 if it scanning to the right element, or moves the pointer s2 if it scanning to the left element. Then if the function found the element, the program will return the address of the element in the tree, otherwise s1 and s2 will pointing to the elements which is just smaller and lager to the element.



And the function of AVL_print, actually just scanning the whole AVL tree by printing from left to nodes to right.