Respond to the following required content in a minimum of 175 words:
Another important property of a binary search tree is being able to easily find the maximum and minimum key in the tree. Thoroughly discuss the simple rule to identifying these keys.
Define the three tree traversal processes (i.e., pre-order, in-order, and post order).
Provide an example of one tree traversal process, ideally utilizing a visual image along with an explanation.