In the lectures last week, we mainly covered binary trees and binary search trees. We also went over how to traverse through trees by inorder, preorder and postorder traversals. Binary trees are something I looked over before coming to class so I did not think I would have much difficulty with it and the same goes for binary search trees as it is not very different from binary trees except for one or two conditions. However, at first glance, I got a little confused with a couple of the methods we completed but as we kept going, I started understanding everything and also being able to predict what the next step would be while writing recursive functions. I am hoping to be able to keep up with what we do and also be able to complete parts of the other functions myself without first seeing how professor Heap does it. It's crucial that I'm on top of all the work because of our test next week which hopefully won't be too difficult.
In the lab exercise for that week, we were supposed to implement recursive functions for binary trees and the lab took a while to complete, however it was a good learning experience as it was good practice for the upcoming test.
No comments:
Post a Comment