This week of class focused on the binary trees to start with. (Actually, it wouldn't be fair not to tell that we did spent starting halves of the both the lectures discussing A2.) The idea behind binary trees was pretty easy to grasp, and so that wasn't much of a problem.
Jokes aside, Danny showed us few methods working over the trees. Still, recursion was needed to be swept in by the brain. This weeks lab was one of the harder ones for me, as few of the recursive calls took some heavy amount of time. None-the-less, it was a good practice and learning experience. Also, we did the three traversal ways: Pre-Order, In-Order and Post-Order in the class. These weren't tough, just had a slight variation.
Everything seemed going well, until I started working on Minimax. I have spent a lot of hours figuring out the problem, as I feel I have got it, some sort of an error pops up. I hope I can get over this challenge soon. Catch you next week after 'conquering' Minimax!
No comments:
Post a Comment