\begin{definition}[Definition:Binary Tree]
A '''binary tree''' is a rooted tree which has at most two branches at any node.
That is, every node in a '''binary tree''' has (apart from the root) degree of either $1$ (for the leaf nodes) or $3$ (one for the parent, two for the children).
\end{definition}