CSC148 Week10 Slog: My impressions of week 9

      In the week 9 lecture, it was about BTNode. BT stands for Binary Tree which has only two children which are left and right. There are only two possibilities for Binary Tree children: one child or two children. We learned about BST to which means Binary Search Tree. It is similar to Binary Tree but the left child is always less than parent node and the right child is always more than parent node.
      Then in the week 9, we had term test 2. It included tree, binary tree, recursion, and linked node. For me, linked node part was hard because I didn't understand linked node more than others. For first parts, it was drawing longest and shortest binary tree. I thought I did well on that but I realized that for longest binary tree, children can be only one child so it was longer than I expected. For other parts, it was similar to lab questions so I think I did good on that parts.