Traversal through BSTs
	• Remember that a binary tree is either empty or it is in the form of a Root with two subtrees. – If the Root is empty, then the traversal algorithm should take no action (i.e., this is an empty tree -- a "degenerate" case). – If the Root is not empty, then we need to print the information in the root node and start traversing the left and right subtrees. – When a subtree is empty, then we know to stop traversing it.