There was a term test 2 this week, which was about recursion, linked list and some definition of tree and traversal method.
I firstly thought i did right on the definition part; however, after checking answers with my friends, i found out that there are some subtle mistakes i made which are actually influential. I misunderstood the way to count the max hight of the tree. Fortunately, i did perfect on the traversal part because i prepared well for it. Either preorder, inorder or postorder, i undertood them totally.
As for the recursive function question, i compared my answer with the solution that Danny posted. I did perfectly.
The last part and the most important part of the test : linkedlist. I knew that i was going to fail on this part because i didnt really understand the concepts of linkedlist. It's my own fault that wasn't being prepared for all questions.
After writing the test, i found out that i still have a lot of problems that are not solved yet. I might be able to write the functions and make them work fine. However, i still do not think like a computer scientist.
No comments:
Post a Comment