📄 avl_lib.html
字号:
<!--#include virtual="header.shtml" -->
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=big5">
<meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
<title></title>
</head>
<body>
<h3 align="center"><font color="#00000A">A
storage-media-independent AVL library</font></h3>
<hr>
<p align="left"><font face="Times New Roman">This article was
contributed by </font><a
href="mailto:Amis.bbs@bbs.ee.nthu.edu.tw"><font
face="Times New Roman">Wu Yuh Song</font></a><font
face="Times New Roman">. </font></p>
<div align="left">
<pre><font size="4" face="Times New Roman">Download Source and Demo project: </font><a
href="AVL_Lib.zip"><font size="4" face="Times New Roman">AVL_Lib.zip</font></a></pre>
</div>
<p><font size="3" face="Times New Roman">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
which that node lies. This is my initial motivation for writing a
'storage-media'independent AVL Tree. However, as you step forth,
you would find that it not only works fine with disks but also
fine with memorys, too.</font></p>
<p align="center">⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -