This week we learned about BSTs, another recursively defined data structure. These are basically trees, only with the property that the given value on a node decides what values fall under the its left and right subtrees. Values that are larger than the value on the node are all in the right subtree, and other values in the left. This organization allows for fast traversals, and for us to be able to quickly find the value we are looking for, since each step eliminates approximately half of all remaining places to search.
We were also introduced to runtime efficiencies and big O notation, as well as a review of logarithms. For me, all of this was basically review of concepts already learned in csc240 and high school math.
No comments:
Post a Comment