Class of November 9th 2017

Data-

Today in class we wen't over more about the upcoming "tree's", as well as some notation's that can be used that are more efficient in c. We also talked a little bit about the EOCE (the fact that it's on its way). As well as the next class that hass is teaching, comp org.

Tree's- The three tree's that we are doing is **in order traversal** which is navigating through the tree by parent, left, then right. Next is **Pre Order traversal** this is where the order is left, parent, right. This gives you the values from least to greatest. The last one is **Post Order traversal** which is going from right, parent, left, which gives you greatest to least values in the tree.

Pol Notation- We wen't over this briefly, but enough to get the premise down. Here is a link to a wiki page about it [[https://en.wikipedia.org/wiki/Reverse_Polish_notation]].

If you are taking Computer Organization next semester, and want to get a head start, then get some practice with **Intel 64 Bit Assembly**


Discrete- We didn't really do anything in discrete, it was pretty much a work on stuff day.