Binary Search Trees

These are easy to grasp since everything is ordered properly. For the exercise, I was stumped for a moment when I realized we were not to use recursive. I've always used recursive for tree traversals. Thankfully, my confusion was cleared when I saw the provided code and took a look at the insert method. Also done with assignment 2 and running tests. Yay and happy halloween everyone!

Nodes and Trees

The concept of node itself isn't hard to grasp and it is very convenient to use since it will always point to the next one. However, many things are easier said than done. I find I am still struggling sometimes with my only method for traversal: RECURSIVE. It does really help to draw example trees out though and it certainly helps me figure out the logic in my recursive. Hopefully with more practice I'll be able to get a hang of this.

Few thoughts on the exam(does not reveal any questions)

No lectures this week due to Thanksgiving and term test. The exam tests were pretty fair. Did not bring nor need any test help sheet. A small confusion on the 3rd question but after seeing the example test case on the second part of the question everything was clarified for me.

Week 5 Slog

Starting to really get a feel for recursion. It's really useful but I have yet ways to go before being able to use it efficiently enough. Still, I'm making progress. Guess I'll just have to see how things go once we progress into binary trees

Inheritance and Recursion

Inheritance is easy enough and also a convenient way to keep code clean when you have classes that are similar. Recursion on the other hand is something I've always had trouble with since I often find the logic there confusing sometimes which results in some unintentional things happening when I use it. Definitely will need more practice in this area.