A Java implementation of a Dictionary backed by an AVL Tree (selfโbalancing BST). It supports adding, searching, deleting words, finding similar words (edit distance 1 by substitution or single ...
The TestAvl.java file must not be modified, and it will be used for testing your AVL Tree class. It does not check for every error, but I hope that it will be helpful for you. The Proj2.java file ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results