Fibonacci Heap - Decrease Key and Delete Operations

Operation decrease key will take the node, decrease the key and if the heap property becomes violated (the new key is smaller than the key of the parent), the node is cut from its parent. If the parent is not a root, it is marked. If it has been marked already, it is cut as well and its parent is marked. We continue upwards until we reach either the root or an unmarked node

Introduction to Algorithms by CLRS
some internet sources

[abhilashpatil]

for the last calculation of amortized analysis, potential function before decrease key should be t(H)+2*m(H)

[zhiyizhu]

Thank you so much!!! The intuition explained helps to understand the algorithm.

[design_future]

In cascade cut function instead of if(z->null), if(z!=null) must be there

[dishagupta]

sir can you pls explain ho we are decreasing 29 to 15.. is there any formula for converting 29 to 15 that is used...?