## Data structures, Binary trees, depth-first traversal

Ok, now we have a very simple class to make a binary tree structure and we can easily represent a tree with it, now what? well, now we are going to learn about the different ways to *traverse* such tree, or well, *visit* all the nodes in the tree. While …