UPDATE ON LINKEDLISTS... DON'T TAKE IT LIGHTLY !

So remembering the properties (mentioned in the previous lecture) with maximum number of nodes and nodes per height was pretty easy. We touched a bit upon Balanced Trees but it seemed too complex for our inferior minds to fully grasp at the moment, so it was only lightly skimmed over.

Reviewing LinkedLists like we have been doing in lab has been somewhat helpful, but it still makes things a lot more confusing. It'll take a lot of self appointed practice time to fully understand LinkedList, especially the head/value/rests part of each list. From what I understand, a LinkedList is made up of two parts,a head ( the value) and the link to another LinkedList. AlthoughI'm still not too sure... I have more reviewing to do, that's  for sure .

Now to head back to clearing up this hazy thing known as binary search tree, I bid you good luck for the upcoming exam!