Week 8

Last week's test actually trolled me somehow, the mark is way lower than I expected, after I get the test returned, I found there are a lot of bug in my code. I should take more attension when I write code by hand writting since paper will never debug code for me.
This week we start out Binary Search Tree. Binary Search Tree is a Binary Tree with a special sorting method. A normal Binary Tree is just a tree that contains only two children, a Binary Search Tree has two children as well but the left child conatins only smaller value than the node, and all the bigger value put in right child. Certainly this would done by recursion