Tuesday, 18 February 2014

The Tree of 148



Tree is one of the most interesting topics I have learned in CSC 148. Although there are many new terminologies, operations, and traversals relating to trees, but I still find it easy to understand compare to recursion. At first, there is a little confusion with the all-different types of traversals: preorder, inorder, and postorder. However, after going through few explanations and examples of traversals, organization of trees seems to be much reasonable and clear. Personally, I find the two representation methods we talked about in class, list of lists and nodes and references (class) are easy to master, which gives the trees complexity in code but simplicity in content. In addition, the Mystery Traversal Code, from the past year’s midterm, that we did on Friday is a petty sick question that combined most of the materials we did so far. It requires me to take some times to go through the code and follows the loops, while tracing the treelist and its organization. Hopefully, the midterm test next will not have questions that are harder then this. The goal for this reading week is to complete the A1, review the materials we learned, and do the past tests to prepare myself for the up coming midterm.

No comments:

Post a Comment