Case 1: right (x) is non empty
successor (x ) = the minimum in right (x)
Case 2: right (x) is empty
go up the tree until the current node is a left child: successor (x ) is the parent of the current node
if you cannot go further (and you reached the root): x is the largest element
