Description: Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in whic
- [btree-mem.tar.z] - B-Tree algorithm writes which with Borl
- [AVLTtreeSource] - this procedure when all the AVL tree alg
- [2006022012065523240] - SHA-1 use. Net declassified document. .
- [bbsxp6] - BBSXP, after she is a perfect design, ap
- [tree] - pda realize the binary tree generated pr
- [Btree] - VLSI design, floorplanning express the l
File list (Check if you may need any files):
Download