A binary tree is a tree where each node may only have up to two children. These children are stored on the
right properties of each node.
When traversing a binary tree, we have three common traversal algorithms: in order, pre-order, and post-order. In this lesson, we write each of these algorithms and explore their differences.