2017年6月28日

Van Emde Boas Tree

摘要： van Emde Boas trees 支持所有优先级优先级队列的操作，并且巧妙的是它对于SEARCH, INSERT,DELETE,MINIMUM,MAXMUN,SUCCESSOR,和PREDECESSOR这些操作的支持都在最坏复 杂度O(lglgn)之内。不过有些限制的是，所有的Kye值都必须在 阅读全文

posted @ 2017-06-28 20:11 Wujunde 阅读(987) 评论(0) 推荐(0) 编辑

Fibonacci Heaps

摘要： Mergeable heapsA mergeable heap is any data structure that supports the following five operations,in which each element has a key:MAKE-HEAP./ creates 阅读全文

posted @ 2017-06-28 15:02 Wujunde 阅读(209) 评论(0) 推荐(0) 编辑

B-trees

摘要： B-trees are balanced search trees designed to work well on disks or other direct accesssecondary storage devices. B-trees are similar to red-black tre 阅读全文

posted @ 2017-06-28 15:02 Wujunde 阅读(276) 评论(0) 推荐(0) 编辑