<input id="squis"></input>
<pre id="squis"></pre> 數(shù)據(jù)結(jié)構(gòu)中的AVL TREE的實現(xiàn)
標(biāo)簽： TREE AVL 數(shù)據(jù)結(jié)構(gòu)
上傳時間： 2014-11-02
上傳用戶：3到15
AVL Tree的實現(xiàn)
上傳時間： 2014-06-15
上傳用戶：wsf950131
Addison-Velski 和 Landis (AVL-Tree s)的二叉樹，可以在對數(shù)時間內(nèi)進(jìn)行標(biāo)準(zhǔn)的操作，如插入、搜索和刪除。
標(biāo)簽： Addison-Velski AVL-Tree Landis 二叉樹
上傳時間： 2013-12-25
上傳用戶：yuzsu
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.
標(biāo)簽： available libraries Although nearly
上傳時間： 2014-01-22
上傳用戶：zhoujunzhen
AVL Tree implementation: I also included a test function to compare the AVL Tree performance with STL Set and Map. Compile the source mavltree.cpp and run it to see the result!
標(biāo)簽： Tree implementation performance AVL
上傳時間： 2013-12-19
上傳用戶：3到15
對三種數(shù)據(jù)結(jié)構(gòu)的分析.avl tree,splaytree和binary search tree的插入和刪除的算法復(fù)雜度分析.
標(biāo)簽： tree splaytree binary search
上傳時間： 2014-01-01
上傳用戶：hustfanenze
It s a note on data structure---AVL tree, very clear and useful!
標(biāo)簽： structure useful clear note
上傳時間： 2015-09-06
上傳用戶：wkchong
數(shù)據(jù)結(jié)構(gòu)與算法分析中AVL Tree的JAVA詳盡代碼 請有需要的同學(xué)下載
標(biāo)簽： Tree JAVA AVL 數(shù)據(jù)結(jié)構(gòu)
上傳時間： 2014-12-08
上傳用戶：liuchee
my AVL tree implementation. Have tested it for 8! deletions sequences with 8! insertion sequences. Fast for order statistics.
標(biāo)簽： sequences implementation deletions insertion
上傳時間： 2017-03-02
上傳用戶：lixinxiang
using C++ to build AVL tree and functions
標(biāo)簽： functions using build tree
上傳時間： 2017-03-12
上傳用戶：shanml
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
