# Prove that if x has a predecessor, this predecessor has a right child

In a BST, Let x be a leaf node, which is a left child of node y. Prove that if x has a predecessor, this predecessor has a right child.

How can I tackle this question? I'm not even sure from where to start.

• Draw the tree . Jan 18 '17 at 22:30