ChPriorityQueues(Heaps)课件优秀讲义.pptVIP

§8 Binomial Queues ? DeleteMin ( H ): H 13 14 26 16 18 12 21 24 65 23 51 24 65 H’ 13 14 26 16 18 Step 1: FindMin in Bk Step 2: Remove Bk from H Step 3: Remove root from Bk 21 24 65 23 51 24 65 H” Step 4: Merge (H’, H”) 23 51 24 65 H 13 21 24 65 14 26 16 18 /* O(log N) */ /* O(1) */ /* O(log N) */ /* O(log N) */ §8 Binomial Queues ? Implementation: Binomial queue = array of binomial trees DeleteMin Merge Find all the subtrees quickly The children are ordered by their sizes Operation Property Solution Left-child-next-sibling with linked lists The new tree will be the largest. Hence maintain the trees in decreasing sizes 13 13 14 26 16 18 12 21 24 65 23 51 24 65 H …… [0] [1] [2] [3] [4] 14 16 26 18 12 24 21 65 23 24 51 65 §8 Binomial Queues §8 Binomial Queues Merge: P245 Tp = O( 1 ) 12 24 21 65 14 16 26 18 T1 T2 CHAPTER 6 PRIORITY QUEUES (HEAPS) §1 ADT Model Objects: A finite ordered list with zero or more elements. Operations: ? PriorityQueue Initialize( int MaxElements ); ? void Insert( ElementType X, PriorityQueue H ); ? ElementType DeleteMin( PriorityQueue H ); ? ElementType FindMin( PriorityQueue H ); —— delete the element with the highest \ lowest priority §2 Simple Implementations ? Array : Insertion — add one item at the end ~ ? ( 1 ) Deletion — find the largest \ smallest key ~ ? ( n ) remove the item and shift array ~ O( n ) ? Linked List : Insertion — add to the front of the chain ~ ? ( 1 ) Deletion — find the largest \ smallest key ~ ? ( n ) remove the item ~ ?( 1 ) ? Ordered Array : Insertion — find the proper position ~ O( n ) shift array and add the item ~ O( n ) Deletion — remove the first \ last item ~ ?( 1 ) ? Ordered Linked List : Insertion — find the proper position ~ O( n ) add the item ~ ?( 1 ) Deletion — remove the first \ last item ~ ?( 1 ) Better since there are never more deletions than insertions ? Binary Search Tree