Binary search tree: remove node

General Information

Algorithmic problem: See the remark clause of Binary Search Tree; pointer p as defined there is the input.

Prerequisites: [math]\displaystyle{ p.left \neq void }[/math]

Type of algorithm: loop

Auxiliary data: A pointer [math]\displaystyle{ p' }[/math] of type "pointer to a binary search tree node".