Overview of Week 8

Binary Search Trees were a primary topic for this week, and understanding of how to effectively traverse a tree which has its elements sorted by side (lesser elements form the left children of each node and greater elements to the right).  This also proved an important concept to me personally as it allowed me to more quickly understand recursion by thinking of binary search trees and their division of sorted elements in a way similar to the merge sort algorithm, which eventually helped me to link various concepts through trees as a recursive structure and gain a better understanding of recursion in general - I wonder if this conceptual link may also aid other students in understanding.