Binary Search tree help
Can somebody explain to me what this code is doing step by step?, thanks


TREE-SUCCESSOR(x)
1 if right[x] ≠ NIL
2 then return TREE-MINIMUM...