Traversal through BSTs
	• You've already seen what the preorder traversal algorithm looks like... – it would traverse the following tree as: 60,20,10,5,15,40,30,70,65,85 – but what would it be using    inorder traversal? – or, post order traversal?