In all cases explain your answers. If you're asked to construct a tree (as in the first 3 problems), at least show a few stages of the construction (do not transcribe the algorithm, but rather show what it does to the tree!). If you are asked to write an algorithm (as in the last 2 problems), it is by no means necessary to implement it, but it is necessary to prove that your algorithm works, and that it satisfies the claimed time bound (either claimed by you or the problem, as appropriate).
Back to CS160 Home Page