Implementing Binary Trees
	• When we implement binary tree algorithms – we have a choice of using iteration or recursion and still have reasonably efficient results – remember why we didn’t use recursion for traversing through a standard linear linked list? – now, if the tree is reasonably balanced, we can traverse through a tree with a minimal number of recursive calls