CSC148 Post #8

Not much happened this week other than writing test 2. I found that the test was pretty fair in terms of difficulty. It tested us on binary trees and linked lists and the recursive functions that go into these ADTs. The lab was quite short too as it was about the insert and delete functions in a binary tree. Essentially what they do is insert values into the tree and also delete values from a tree. 

The thing that I did not understand at first though was that when we delete a value, what happens to that slot? Does it stay empty? So what really happens is that when a value is deleted, the next child node of that value replaces it. 

Anyways, since there was no lab this week because of the strike, there hasn't really been much going on in lectures. Unfortunately I have nothing else to write about for this week, but thanks for reading!