问题描述：设计一个英汉词典，支持Member的查找、插入、删除操作。

基本要求：实现字典的常用方法有：有序线性表（用二分检索实现）、AVL树（二叉搜索树）、Patricia Tree、散列表等，任选一种方法实现字典的操作，查找单词、插入单词（插入时，先查找，找不到插入，找到提示用户）、删除单词（删除时，先查找，找到删除，找不到提示用户）。字典是按字母顺序排列的，不能用顺序查找，插入或删除单词后，要保持字典的有序性。

测试数据：任一英文单词。

提高要求：选用两种以上的方法实现字典的操作，要比较不同实现算法的时间复杂度和空间复杂度。

-Problem Descr iption: design an English-Chinese dictionary, support Member search, insert, delete operation.Basic requirements: to achieve the dictionary usually used methods are: linear table ( with two points and retrieval ), AVL tree ( binary search tree ), Patricia Tree, hash table, choose one method to realize the operation of finding words, dictionary, insert the word ( when inserted, to find, to find insert, find tips user ), delete ( delete words, first search, find the delete, find prompting the user). The dictionary is arranged in alphabetical order, not a sequential search, insert or delete a word, to maintain the order of the dictionary.Test data: any English words.Improve requirements: selection of more than two kinds of method to realize the operation of the dictionary, to compare different algorithm time complexity and space complexity.