After the reading week, I feel myself a little bit less productiviy. It is probably because I didn't practice and study during the reading week at all, though that was a result of some troubles. All in all, I have learnt a lesson from this and will work harder during the vacations in the future.
Back to the topics, during week 7 Prof Heap introduces us the idea of binary tree. It seems to be simpler than the genral Tree class, as it has some particular properties, such as each internal node should have no more than two chidren. And the Binary Search Tree is even more identical, with comparable data in a increasing order as left subtree < node <right subtree. However, it is useful. It is right because we have these properties, we could write more helpful methods and funcitons with them. For instance, when searching a number inside BST, we don't necessarily check evey node. In the worst case, we can check up to half of the nodes only. I believe there is more fun waiting ahead.
Also, I start working on Assignment 2 as Prof Heap suggests. It seems to be more complicated than A1 whereas it might even be less actual coding works. I think the idea behind constrcuting new game type and epspecially the new strategy is the key.
