There are $2$ different binary trees with $2$ nodes if we don't care about the key values in them but only their shapes we get:

o o

$/$ and $\backslash$

o o

Use recursion to argue that there are $5$ different binary trees with $3$ nodes.

How many different binary trees with $4$ nodes are there $?$ Justify your answer.