week 9

I find the binary search tree interesting as well as the method to implement it. It seems so simple but gets a bit complex for myself when coding in regards to deciding if a node is smaller than the next node and how to place it. I will keep going over this until it clicks for me. I do appreciate that the Tree class can be expanded into more complex codes and structure, that use its basic structure of data which connects to a left and right subtree. I learned from the exercise that a preorder and in order traversal can give you enough information to make a tree. I didn't exactly understand the algorithm performance and behaviour part or how it co-relates to how fast an algorithm will run or how to read the informations given for this?