一个应用二叉搜索树实现的字典，并存储结构于文件中

一个应用二叉搜索树实现的字典，并存储结构于文件中

QUOTE> Super Power Dictionary C.Third Edition This is the third edition of my dictionary and it is very, very powerful now! Read in 20K words from a 2.3M text file only uses less than 2seconds. However, ranking them will take 41seconds! As it need to track each node from "WordTree" from "big to small" by "Frequency" and "rank" them by this sequence and then copy each node to a node of "RankTree" then "insert" the new rankTree node into ranktree. 1。 Basic idea: I found out some mistakes in "ranking" functions. And it is really a hardtime to debug for a whole day in lab(almost 8hours from 10:00AM to 18:30PM). 2。 Program design: The biggest problem is still how to walk round the "key" problem of RankTree by using "frequency" 【我对这篇文章有话说?】