文件名称:tree
介绍说明－－下载内容均来自于网络，请自行研究使用
查找序列以带头结点的单链表表示，各结点中设一个访问频度，初始值为 0，每次查找成功后该结点频度值增加 1。试给出算法，在每次查找后查找序列均按访问频度从大到小排列。
-Find a sequence of nodes in order to take the lead in a single list that each node in a visit to the frequency, the initial value of 0, after the success of each to find the node frequency value increased by 1. Test given algorithm, after each search to find sequences are arranged visit smallest frequency.
-Find a sequence of nodes in order to take the lead in a single list that each node in a visit to the frequency, the initial value of 0, after the success of each to find the node frequency value increased by 1. Test given algorithm, after each search to find sequences are arranged visit smallest frequency.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
平衡树.cpp
平衡树文档.doc
平衡树文档.doc