 Hence, the actual time for running "m" Inc operations is O("m").The potential function method is commonly used to analyze Fibonacci heaps, a form of priority queue in which removing an item takes logarithmic amortized time, and all other operations take constant amortized time.It may also be used to analyze splay trees, a self-adjusting form of binary search tree with logarithmic amortized time per operation.