二项式堆演示文件修改版.pptVIP

高级数据结构 ——二项式堆 Binomial Heaps Binomial Heaps Min Binomial Heap Collection of min trees. Node Structure Degree Number of children. Child Pointer to one of the node’s children. Null iff node has no child. Sibling Used for circular linked list of siblings. Data Binomial Heap Representation Insert 10 Add a new single-node min tree to the collection. Meld Combine the 2 top-level circular lists. Meld Remove Min Empty binomial heap = fail. Nonempty Binomial Heap Remove a min tree. Reinsert subtrees of removed min tree. Update binomial heap pointer. Remove Min Tree Same as remove a node from a circular list. Reinsert Subtrees Combine the 2 top-level circular lists. Same as in meld operation. Update Binomial Heap Pointer Must examine roots of all min trees to determine the min value. Complexity Of Remove Min Remove a min tree. O(1). Reinsert subtrees. O(1). Update binomial heap pointer. O(s), where s is the number of min trees in final top-level circular list. s = O(n). Overall complexity of remove min is O(n). Enhanced Remove Min During reinsert of subtrees, pairwise combine min trees whose roots have equal degree. Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Pairwise Combine Complexity Of Remove Min Create and initialize tree table. O(MaxDegree). Done once only. Examine s min trees and pairwise combine. O(s). Collect remaining trees from tree table, reset table entries to null, and set binomial heap pointer. O(MaxDegree). Overall complexity of remove min. O(MaxDegree + s). Binomial Trees Bk is degree k binomial tree. Examples Number Of Nodes In Bk Nk = number of nodes in Bk. Equivalent Definition Nk And MaxDegree N0 = 1 Nk = 2Nk-1 = 2k. If we start with zero elements and perform operations as described, then all trees in all binomial heaps are binomial trees. So, MaxDegree = O(log n). B0 Bk , k 0, i