Week 5 of CSC236

Structural induction seems very familiar to simple induction that we have done in class. Especially the full binary tree problems and the set theory problems which rely a lot on the structure of the item which we need to prove. It seems odd at first that trees need to be proven without using the number of nodes, but i suppose it is important to prove items with their previous structure intact. The test seemed easily , except maybe the time constraint made it a little difficult to think clearly.The questions did not seem very difficult , but obviously without notes , in the beginning they seemed a little difficult , but as started to write the induction proof structure , the proof came together very nicely. Again maybe a little more time would've helped me to finish the last question.