Week 8 Material

We have started to learn how to evaluate the efficiency of an algorithm and tried to come up with a more efficient binary tree this week.  Deleting and inserting a note into a existing tree is also discussed this week. In addition, the topic of run time analysis has been introduced to us and it is quite similar from the materials that i have been learning in CSC165, however, csc165 gave a more comprehensive introduction toward this topic. 

We constructed a binary search tree with the binary search node with the functions insert and delete and we used nested functions to accomplish out goals. I don't understand why some time when we are initializing a class, we put underscore _ in front of a argument. (i.e. self._root)