Visually Explained Algorithms There are three types of depth first binary tree traversals: Pre-order: <root><left><right> In-order: <left><root><right> Post-order: <left><right><root> We will be focusing on the In-Order Binary Tree Traversal. We can see that starting from the root node, we’ll visit all the nodes in the left subtree, come back to the root node and then visit all the vertices in the right subtree. Next to each node, we’ll put a couple of reminders for ourselves: left subtree visit/print node right subtree We’ll begin with the root node. At this point, we can cross out the left subtree label and start