Overview of Week 12

This week of the course was perhaps one of the most interesting as it has relied on our ability to link together many of the previous concepts of the course in the creation of a complete binary tree type.  This was a special subclass of a regular binary tree in which each depth must be filled before any nodes at a greater depth can be added, and nodes are populated in a specifically left to right order, then top to bottom, from the root.

This required extensive knowledge both of recursion and trees which have been some of our primary topics of discussion throughout the semester.  It also provided an easy and reliable way to ensure trees are populated in a specific way, which could aid us in future use of trees, if we need to be able to examine trees in a parallel order, if we have access to the list of values, in the order they were populated into a complete binary tree we can bypass our usual methods of traversal and write a much simpler method.  Very interesting stuff!