高级数据结构-pairing Heap.ppt

Pairing Heaps Pairing Heaps Pairing Heaps Experimental results suggest that pairing heaps are actually faster than Fibonacci heaps. Simpler to implement. Smaller runtime overheads. Less space per node. Definition A min (max) pairing heap is a min (max) tree in which operations are done in a specified manner. Node Structure Child Pointer to first node of children list. Left and Right Sibling Used for doubly linked linked list (not circular) of siblings. Left pointer of first node is to parent. x is first node in list iff x.left.child = x. Data Note: No Parent, Degree, or ChildCut fields. Meld – Max Pairing Heap Compare-Link Operation Compare roots. Tree with smaller root becomes leftmost subtree. Insert Create 1-element max tree with new item and meld with existing max pairing heap. Insert Create 1-element max tree with new item and meld with existing max pairing heap. Worst-Case Degree Insert 9, 8, 7, …, 1, in this order. Worst-Case Height Insert 1, 2, 3, …, n, in this order. IncreaseKey(theNode, theAmount) Since nodes do not have parent fields, we cannot easily check whether the key in theNode becomes larger than that in its parent. So, detach theNode from sibling doubly-linked list and meld. IncreaseKey(theNode, theAmount) IncreaseKey(theNode, theAmount) IncreaseKey(theNode, theAmount) Remove Max If empty = fail. Otherwise, remove tree root and meld subtrees into a single max tree. How to meld subtrees? Good way = O(log n) amortized complexity for remove max. Bad way = O(n) amortized complexity. Bad Way To Meld Subtrees currentTree = first subtree. for (each of the remaining trees) currentTree = compareLink(currentTree, nextTree); Example Remove max. Example Actual cost of insert is 1. Actual cost of remove max is degree of root. n/2 inserts (9, 7, 5, 3, 1, 2, 4, 6, 8) followed by n/2 remove maxs. Cost of inserts is n/2. Cost of remove maxs is 1 + 2 + … + n/2 – 1 = Q(n2). If amortized cost of an ins