Very often simple arithmetic can be stored in a binary tree (a + b = c). What are the three ways to traverse such a tree? If you wrote what you found at each node what would you write if you traversed the tree in order? Post order? Pre order?