insert cost - - potential change - - - figure the insertion cost and potential change for each operation in sequence skew heaps the analysis of binomial queues is fairly easy example of an amortized analysis we now look at skew heaps as is common with many of our examplesonce the right potential function is foundthe analysis is easy the difficult part is choosing meaningful potential function recall that for skew heapsthe key operation is merging to merge two skew heapswe merge their right paths and make this the new left path for each node on the new pathexcept the lastthe old left subtree is attached as the right subtree the last node on the new left path is known to not have right subtreeso it is silly to give it one the bound does not depend on this exceptionand if the routine is coded recursivelythis is what will happen naturally figure shows the result of merging two skew heaps suppose we have two heapsh and and there are and nodes on their respective right paths then the actual time to perform the merge is proportional to so we figure merging of two skew heaps