Thursday, 13 February 2014

SLOG Entry#4

     Greeting to all my SLOG blog readers. This week in computer science, we went over Trees. Not the kind of trees you find outside in a park. The Trees we talked about were a special kind of list. A Tree is basically an object that holds a value and points to some other objects that also hold values and also point to some more objects that hold values and so on. We talked about simple Trees, called Binary Trees as each object only pointed to up to two other objects, as they were the easiest to work with. We went over all the terminology one uses when working with Trees and the different methods to traverse them. The last topic specifically used recursion, an important concept we went over with some detail these past few weeks. Trees are an important data structure to know, as it is one of the commonly used Abstract Data Types. That's what I learned about this week. I will not be updating my blog next week sadly, as its Reading Week, not so sadly, so there won't be any lectures to blog about. Tune in in two weeks for more computer science.

No comments:

Post a Comment