This assignment will help you practice and understand better the Binary Tree and Binary Search Tree data structures, their operations and implementations.
You are to design a small dictionary using the Binary Search Tree data structure. Each entry may include a word and its definitions. You should create the tree structure/dictionary using data input from an XML file and keep the file updated. After the dictionary is created, the user can search for a word. If it‘s found, the definitions are displayed. If the searched word is not found, the user can add the word to the dictionary.
木其工作室。专业程序代写
代写程序|java二叉树字典查询（qq 928900200）,布布扣,bubuko.com
代写程序|java二叉树字典查询（qq 928900200）
原文：http://www.cnblogs.com/java201407/p/3883519.html