An efficient Dictionary which It's implemented using AVL tree data structure.
We can efficiently insert, search and delete words from our dictionary.
- AVL tree: It's a BST with lookup, insertion and deletion of order O(log(n)),
Our AVL tree supports duplication.