In a Binary Search Tree Smallest data larger than node One step to the right, then as far left as possible