This week we further extended our understanding of binary search trees(BTS) by looking into some methods that mutates these trees. Just to remind ourselves, a BTS has comparable nodes and satisfies the restriction that the left sub-tree contains only nodes with data less than the parent node(node.left < node. data), and the right sub-tree contains only nodes with data greater than the parent node(node.right > node.data), also keeping in mind that each node has no more than two children. With these in mind, we talked about insert, and delete methods in lecture. These methods are recursive, and we had first implement the base case where it is simple enough that it does not require recursion, then the more complicated cases where recursion is needed.
Unfortunately, we lost all labs and tutorials due to TA strike. I had CSC165 test a day before the test for this course and it was nevertheless a stressful week especially without the TA's reinforcements on some of the core materials. Now that the two computer science tests are done, and the two assignments that corresponds to the two courses finished just the week before the tests, I am glad I made it through. I thought the both tests were fair as they reflect the amount of time and effort we put in preparing for them. With two other mid-terms coming up this week and the week after, I have came to realized how important it is to develop a good study habit so that we are able to better manage our time. And looking back at myself, I have definitely improved in utilizing my time more efficiently compared to when I first entered the university. With these in mind, I am prepared to battle through remaining school year.
No comments:
Post a Comment