an example of a valuable reentrant function use:

a priority queue datastructure.

this maintains a complete binary tree structure (no gaps) containing tasks pointers. as a new task is added or the highest priority task extracted, the structure is "perculated" via a reentrant function to reprioritize the structure.

duh