Not going to write much here as I have Linear Algebra quiz and this course's midterm on Friday: we finished up proving using structural induction on the number of nodes in a binary tree, and started to prove the matching parenthesis claim.
The claim itself is a bit weird (haven't seen a proof like this), along with the fact that I am always tired in the morning that affects my thinking (so I didn't even bother trying out the proof for it but just plainly write the initial solution down).
Don't really want to waste time here, as I'm behind in reading for both MAT223 and this course, got to get as much as I can done before the test starts.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment