Additional context
I noticed that BFS and DFS in the BinaryTree class are missing. I would like to add the BFS and create a note relating to the equivalence between DFS and in-order traversal.
I have noticed that this has been referenced before in regards to the more general graph, but never implemented for the binary tree specifically.