A full node is a node with two non-NULL children. Prove that the number of full nodes plus one is equal to the number of leaves.

I want to do induction on the number of nodes but I am having problems. Could someone please explain this to me step by step?