the only thing that i find difficult about test 2 is big O notation, and how searching and sorting trees and lists have different times based on algorithm efficiency.other than that, binary trees and everything related to them are pretty self-explanatory. Danny did a really really good job of describing trees in detail and doing examples.
there wasn't an exercise, so nothing to comment on there.
assignment 2 was just handed in. hopefully all the test cases will be rational ones, not silly extreme examples, like 1********************* or 1|1******************************.
I imagine those cases had to be covered - or, something similar.
ReplyDelete